The Community for Technology Leaders
Parallel Architectures, Algorithms, and Networks, International Symposium on (1997)
Taipei, Taiwan
Dec. 18, 1997 to Dec. 20, 1997
ISSN: 1087-4089
ISBN: 0-8186-8259-0
pp: 344
Runhe Huang , The University of Aizu
Jianhua Ma , The University of Aizu
D. Frank Hsu , Fordham University
ABSTRACT
In this paper, a genetic algorithm for three connected telecommunication network designs is proposed. The genetic algorithm uses a new approach to solution representation, in which constraints such as diameter and connectivity constraints can be easily encoded and two-point crossover with the operation of swapping duplicated nodes ensures solutions generated through genetic evolution are all feasible so that both checking of the constraints and repair mechanism can be avoided. Both efficiency and effectiveness are increased due to no checking of the constraints and no repair mechanism conducted. In fact, our design algorithm for three-connected network design can be extended to a high-connectivity network design.
INDEX TERMS
CITATION

J. Ma, R. Huang and D. F. Hsu, "A Genetic Algorithm for Optimal 3-Connected Telecommunication Network Designs," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Taipei, Taiwan, 1997, pp. 344.
doi:10.1109/ISPAN.1997.645118
90 ms
(Ver 3.3 (11022016))