A Genetic Algorithm with Dual-Structure Code and Adaptive Strategy for Link Enhancement Problem

Author

Liu, Yuhua ; Teng, Wei ; Xu, Kaihua ; Zhu, Haiyan

Author_Institution

Dept. of Comput. Sci., Central China Normal Univ., Wuhan

Volume

2

fYear

2006

fDate

20-24 June 2006

Firstpage

699

Lastpage

705

Abstract

Link enhancement problem is a combinatorial optimization problem, and genetic algorithm is suitable to solve the combinatorial optimization problem. Commonly, the genetic algorithms are adopt one dimension code, this paper adopt the dual-structure code and adaptive probabilities of crossover and mutation to solve the link enhancement problem. In the simulation experiment, we compare the performance of dual-structure code genetic algorithm and one dimension code genetic algorithm

Keywords

combinatorial mathematics; computer networks; genetic algorithms; probability; telecommunication links; telecommunication network topology; adaptive probability; combinatorial optimization problem; computer networks; dual-structure code; genetic algorithm; link enhancement problem; one dimension code; Application software; Computational modeling; Computer networks; Computer science; Costs; Genetic algorithms; Genetic mutations; Linearity; Network topology; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on

Conference_Location

Hanzhou, Zhejiang

Print_ISBN

0-7695-2581-4

Type

conf

DOI

10.1109/IMSCCS.2006.151

Filename

4673788