A Genetic Algorithm Approach for the Design of Minimum Cost Survivable Networks with Bounded Rings

  • B. Ombuki (Faculty of Engineering University of the Ryukyus) ;
  • M. Nakamura (Faculty of Engineering University of the Ryukyus) ;
  • Na, Z.kao (Faculty of Engineering University of the Ryukyus) ;
  • K.Onage (Faculty of Engineering University of the Ryukyus)
  • Published : 2000.07.01

Abstract

We study the problem of designing at minimum cost a two-connected network topology such that the shortest cycle to which each edge belongs does not exceed a given maximum number of hops. This problem is considered as part of network planning and arises in the design of backbone networks. We propose a genetic algorithm approach that uses a solution representation, in which the connectivity and ring constraints can be easily encoded. We also propose a crossover operator that ensures a generated solution is feasible. By doing so, the checking of constraints is avoided and no repair mechanism is required. We carry out experimental evaluations to investigate the solution representation issues and GA operators for the network design problem.

Keywords