DocumentCode
2827368
Title
The Solution for Link Enhancement Problem Based on Ant Algorithm
Author
Yuhua Liu ; Wei Teng ; Kaihua Xu ; Haiyan Zhu
Author_Institution
Dept. of Comput. Sci., Central China Normal Univ., Wuhan
fYear
2005
fDate
21-23 Sept. 2005
Firstpage
447
Lastpage
453
Abstract
In this paper, we discuss the essential of traveling salesman problem (TSP) and link enhancement problem. We present a solution for link enhancement problem based on ant algorithm. To deal with the restriction condition, we propose two different kinds of strategies. By the simulation experiment, the algorithm is proved to be feasible. With the result of simulation experiment, we analyze the enactment of the parameters, and compare the performance of the two strategies
Keywords
computer networks; genetic algorithms; travelling salesman problems; ant algorithm; link enhancement problem; traveling salesman problem; Analytical models; Computational modeling; Computer networks; Computer science; Costs; Heuristic algorithms; Network topology; Performance analysis; Space exploration; Traveling salesman problems; Ant algorithm; Heuristic method; Link enhancement; Topology structure expansion;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on
Conference_Location
Shanghai
Print_ISBN
0-7695-2432-X
Type
conf
DOI
10.1109/CIT.2005.191
Filename
1562691
Link To Document