Parallel Genetic Algorithm for Solving the Multilayer Survivable Optical Network Design Problem

摘要

We study the multilayer survivable optical network design problem. Given an undirected graph G_1 = (V_1, E_1), a complete undirected and weighted graph G_2 = (V_2, E_2, 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 paper focuses on implementing a Parallel Genetic Algorithm (PGA) for solving multilayer optical network, called MSONDP. The experimental results on real world and random instances are reported to show the efficiency of proposed algorithm comparing to the GAMSONDP in term of minimize the network cost and especially running time.