An Evolutionary Algorithm Approach to the Design of Minimum Cost Survivable Networks with Bounded Rings(Special Section on Papers Selected from ITC-CSCC 2000)

概要

論文の詳細を見る
This paper presents a genetic algorithm for designing at minimum cost a two-connected network topology such that the shortest cycle(referred to as a ring)to which each edge belongs does not exceed a given maximum number of hops. The genetic algorithm introduces a solution representation in which constraints such as connectivity and ring constraints are easily encoded. Furthermore, a problem specific crossover operator that ensures solutions generated through genetic evolution are all feasible is also proposed. Hence, both checking of the constraints and repair mechanism can be avoided thus resulting in increased efficiency. Experimental evaluation shows the effectiveness of the proposed GA.
社団法人電子情報通信学会の論文
2001-06-01