Multilayer Survivable Optical Network Design

Borne, Sylvie; Gabrel, Virginie; Mahjoub, Ridha; Taktak, Raouia

doi:10.1007/978-3-642-21527-8_22

Cited by 7 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2011, MSONDP was proven to be NP-hard by S.Borne et.al [1]. They formulated this problem in terms of 0-1 linear program based on path variables.…”

Section: Related Workmentioning

confidence: 99%

“…So, MSONDP was only defined by S.Borne in 2011 [1], which shows this is a new model of SNDP. And for now, there have not any effective algorithms to solve this model with the large test sets.…”

Section: Related Workmentioning

confidence: 99%

“…Up to now, only research group of Sylvie Borne research this problem and publish their results in [1]. So, in this paper, we propose a genetic algorithm for solving MSONDP, called GAMSONDP.…”

Section: Introductionmentioning

confidence: 99%

“…And a new characteristic of GAMSONDP is that we use two crossover and three mutation operation types simultaneously to bear new individuals more diversely, which makes GA more effective. We experiment with the data which used in [1] and compare the result with Branch and Price in [1].…”

Section: Introductionmentioning

confidence: 99%

“…This is a new model of SNDP and according to [1], it is a NP-hard problem even for one demand. Up to now, only research group of Sylvie Borne research this problem and publish their results in [1].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Genetic Algorithm for Solving Multilayer Survivable Optical Network Design Problem

Bình¹,

Ly²

2012

IJMLC

View full text Add to dashboard Cite

Abstract-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 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 Index Terms-Survivable network design, genetic algorithm, branch-and-price.

show abstract

“…In 2011, MSONDP was proven to be NP-hard by S.Borne et.al [1]. They formulated this problem in terms of 0-1 linear program based on path variables.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations