You are here

Brock TR # CS-04-09 Abstract

A genetic algorithm for the design of two-connected networks with bounded rings    [PDF]
M. Ventresca and B. Ombuki, July 2004.

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 is proposed in this paper. We provide numerical results based on randomly generated graphs found in literature and compare the solution quality with that of tabu search and branch and bound. The results demonstrate the effectiveness of our algorithm. Except for our previous preliminary work, 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.