Abstract
In this paper, a two-stage evolutionary algorithm is proposed to solve an N P -complete telecommunication problem—all optical wavelength-division multiplexing (WDM) mesh network survivability under shared-risk-link-group (SRLG) constraints. First of all, a novel greedy heuristic with two control parameters is developed to construct feasible solutions of the telecommunication problem. An estimation of distribution algorithm (EDA) with guided mutation is applied to search for optimum settings of the two control parameters in respective two stages. Given the found best control parameters, an optimal solution of the considered problem can be constructed by the greedy heuristic. Experimental results show that the proposed approach compares favorably against the best-known evolutionary-based algorithm in 26 out of 30 test instances in terms of solution quality within given time limit.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
