earticle

영어

This paper considers the problem of designing a Multilayer Survivable Optical Network for the customers’ Demands Problem called MSONDP. The network is modelled by two graphs: an undirected graph G1 = (V1, E1) and a complete undirected and weighted graph G2 = (V2, E2, c). The goal objective of this problem is to design connections based on customers’ demands with the smallest a minimum network cost to protect the network against all failures. This paper introduces a multi-objective approach for MSONDP. These objectives are to minimize the network cost (totalCost) and the maximum number of connections passing over a link (maxConn). Further, this paper also proposes a multi-objective genetic algorithm to solve this problem. The eExperimental results on real world and random instances are reported to show the efficiencyefficacy, in terms of minimizing the network cost, of the proposed algorithm comparing compared to the single genetic PGAMSONDP.