A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings

This paper presents a genetic algorithm for designing minimum-cost two-connected networks such that the shortest cycle to which each edge belongs to does not exceed a given length. We provide numerical results based on randomly generated graphs found in the literature and compare the solution quality with that of tabu search and branch and bound. The results demonstrate the effectiveness of our algorithm and show promise for tackling ring-based network design problems. This paper is among the first to document the implementation of a genetic algorithm for the design of two-connected networks with the added constraint of bounded rings.

[1]  Martine Labbé,et al.  Polyhedral results for two-connected networks with bounded rings , 2002, Math. Program..

[2]  Mir M. Atiqullah,et al.  Reliability optimization of communication networks using simulated annealing , 1993 .

[3]  Hanan Luss,et al.  Design of Stacked Self-Healing Rings Using a Genetic Algorithm , 2000, J. Heuristics.

[4]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

[5]  K. Steiglitz,et al.  The Design of Minimum-Cost Survivable Networks , 1969 .

[6]  G. D. Smith,et al.  Genetic algorithms and network ring design , 1999, Ann. Oper. Res..

[7]  Sylvia C. Boyd,et al.  An Integer Polytope Related to the Design of Survivable Communication Networks , 1993, SIAM J. Discret. Math..

[8]  Martine Labbé,et al.  Two-Connected Networks with Rings of Bounded Cardinality , 2004, Comput. Optim. Appl..

[9]  Francesco Maffioli,et al.  Solving the Two-Connected Network with Bounded Meshes Problem , 2000, Oper. Res..

[10]  Godfrey A. Walters,et al.  EVOLUTIONARY DESIGN ALGORITHM FOR OPTIMAL LAYOUT OF TREE NETWORKS , 1995 .

[11]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[12]  M. Grötschel,et al.  Chapter 10 Design of survivable networks , 1995 .

[13]  Martin Grötschel,et al.  Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..

[14]  Alice E. Smith,et al.  Local search genetic algorithm for optimal design of reliable networks , 1997, IEEE Trans. Evol. Comput..

[15]  Alice E. Smith,et al.  Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics , 2003, J. Heuristics.