Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17230
Title: Survivable network design with shared-protection routing
Authors: Agarwal, Y. K.
Venkateshan, Prahalad
Keywords: Shared protection survivable network design;End-to-end restoration schemes;Column generation;Large scale optimization
Issue Date: 2014
Publisher: Elsevier
Citation: Agarwal, Y. K., & Venkateshan, P. (2014). Survivable network design with shared-protection routing. European Journal of Operational Research, 238(3), 836-845.
Abstract: In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global re-routing have been used to obtain very tight lower bounds for the problem. Our results indicate that in a majority of problem instances, the average gap between the heuristic solutions and the lower bounds is within 5%. Computational experience is reported on randomly generated problem instances with up to 35 nodes, 80 edges and 595 demand pairs and also on the instances available in SNDlib database.
URI: http://hdl.handle.net/11718/17230
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Survivable network design with shared-protection.pdf
  Restricted Access
944.18 kBAdobe PDFView/Open Request a copy


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.