A genetic algorithm for optimal 3-connected telecommunication network designs

Author

Huang, Runhe ; Ma, Jiahnua ; Hsu, D. Frank

Author_Institution

Dept. of Comput. Software, Aizu Univ., Japan

fYear

1997

fDate

18-20 Dec 1997

Firstpage

344

Lastpage

350

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 he extended to a high-connectivity network design

Keywords

genetic algorithms; graph theory; network topology; telecommunication network routing; genetic algorithm; high-connectivity network design; repair mechanism; telecommunication network design; three connected telecommunication network; Algorithm design and analysis; Cities and towns; Communication networks; Computer networks; Costs; Genetic algorithms; Routing; Software; Telecommunication computing; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Conference_Location

Taipei

ISSN

1087-4089

Print_ISBN

0-8186-8259-6

Type

conf

DOI

10.1109/ISPAN.1997.645118

Filename

645118