• Dec 20, 2017 News!ACMLC 2017 has been successfully held in NEC, Singapore during December 8-10.   [Click]
  • Dec 12, 2017 News!Good News! All papers from Volume 7, Number 1 to Volume 7, Number 5 have been indexed by Scopus!   [Click]
  • Mar 05, 2018 News!Welcome Assoc. Prof. Xianghua Xie, University of Swansea, UK joins our editorial board.
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2012 Vol.2(6): 812-816 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2012.V2.243

Genetic Algorithm for Solving Multilayer Survivable Optical Network Design Problem

Huynh Thi Thanh Binh, and Ha Dinh Ly
Abstract—Given an undirected graph G1 = (V1, E1), a complete undirected and weighted graph G2 = (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 [12] and real world instances [1]. The experimental results are reported to show the efficiency of proposed algorithm comparing to the Branch and Price algorithm [1].

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; greeny255@gmail.com ).

[PDF]

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.

Copyright © 2008-2018. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net