Abstract
A tabu search procedure is developed to solve fiber optic communication network design problems with survivability constraints. Two systematic improving heuristics: delete-add and delete-link procedures are presented. The conditions for the candidate links to be added and deleted in the two procedures are examined by considering the feasible structures of the survivable network. A local improvement procedure is considered by combining the two heuristics for the downhill move in the search procedure. Computational results show that the proposed tabu search outperforms the best known heuristic procedure in the literature.
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.
