Abstract
This thesis presents methods for the network planning problem of bidirectional self-healing ring (BSHR), which is a network structure providing higher survivability when there is a failure on link or node. Given a network with nodes, links, and demand pairs, the problem is to design an optimal network comprising some rings which use only the existing links to satisfy all demands. The objective is to minimize the total number of equipment (add/drop multiplexer) on nodes, which is the major cost of SHR structure. We propose two integer programming (IP) formulations for this problem. For larger networks, we have developed an efficient heuristic algorithm hierarchically based on the IP model to obtain a near optimal solution.