Algorithms for the survivable telecommunications network design problem under dedicated protection

Abstract

This thesis presents algorithms to solve a survivable network design problem arising in telecommunications networks. As a design problem, we seek to find 2-edge disjoint paths between every potential origin destination pair such that the fixed costs of installing edges and the routing costs are jointly minimized. Despite the fact that the survivable network design literature is vast, the particular problem at hand incorporating fixed and variable edge costs as well as different cost structures on the two paths has not been studied. Initially, an IP model addressing the proposed problem is developed. In order to solve problems of higher dimensions, different heuristic algorithms are designed and results of a computational study on a large bed of problem instances are reported.