Abstract—Given an undirected graph G 1 = (V 1 , E 1 ), a c omplete undirected and weighted graph G 2 = (V2, E2, c) and a set of customers’ demands. The goal is to design connections based on customers’ demands with the smallest network cost to protect the network against all failures. This problem is NP-hard. This paper proposes a genetic algorithm for solving the Survivable Network Design Problem (SNDP). We experiment our proposed algorithm on random  and real world instances . The experimental results are reported to show the efficiency of proposed algorithm comparing to the Branch and Price algorithm .
Index Terms—Survivable network design, genetic algorithm, branch-and-price.
The authors are with Ha Noi University of Science and Technology, School of Information and Communication Technology (e-mail: binhht@ soict.hut.edu.vn; email@example.com ).
Cite:Huynh Thi Thanh Binh, and Ha Dinh Ly, "Genetic Algorithm for Solving Multilayer Survivable Optical Network Design Problem," International Journal of Machine Learning and Computing vol.2, no. 6, pp. 812-816, 2012.