A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS

2005 ◽  
Vol 05 (02) ◽  
pp. 267-281 ◽  
Author(s):  
MARIO VENTRESCA ◽  
BEATRICE M. OMBUKI
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Network Design ◽  
Branch And Bound ◽  
Minimum Cost ◽  
Numerical Results ◽  
Solution Quality ◽  
Design Problems ◽  
Network Design Problems

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.

scholarly journals Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

Algorithmica ◽  
2001 ◽  
Vol 31 (1) ◽  
pp. 58-78 ◽  
Author(s):  
R. Ravi ◽  
M. V. Marathe ◽  
S. S. Ravi ◽  
D. J. Rosenkrantz ◽  
H. B. Hunt III
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Minimum Cost ◽  
Design Problems ◽  
Network Design Problems

scholarly journals Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009 ◽  
pp. 241-266
Author(s):  
R. Ravi ◽  
Madhav V. Marathe ◽  
S. S. Ravi ◽  
Daniel J. Rosenkrantz ◽  
Harry B. Hunt
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Minimum Cost ◽  
Design Problems ◽  
Network Design Problems

A Hybrid Lagrangian Relaxation and Tabu Search Method for Interdependent-Choice Network Design Problems

2011 ◽  
pp. 294-324 ◽  
Author(s):  
Chi Xie ◽  
Mark A. Turnquist ◽  
S. Travis Waller
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Lagrangian Relaxation ◽  
Optimization Problems ◽  
Search Method ◽  
Network Design Problem ◽  
Design Problems ◽  
Network Design Problems ◽  
Tabu Search Method ◽  
Algorithmic Logic

Hybridization offers a promising approach in designing and developing improved metaheuristic methods for a variety of complex combinatorial optimization problems. This chapter presents a hybrid Lagrangian relaxation and tabu search method for a class of discrete network design problems with complex interdependent-choice constraints. This method takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction while its algorithmic logic is designed based on the principles of tabu search. The algorithmic advance and solution performance of the method are illustrated by implementing it for solving a network design problem with lane reversal and crossing elimination strategies, arising from urban evacuation planning.

Sign in / Sign up

Export Citation Format

Share Document