DocumentCode
2995610
Title
Ant colony optimization for multicast routing
Author
Wang, Ying ; Xie, Jianying
Author_Institution
Inst. of Autom., Shanghai Jiaotong Univ., China
fYear
2000
fDate
2000
Firstpage
54
Lastpage
57
Abstract
Ant colony optimization (ACO) is a new optimization algorithm, and has the limitation of stagnation. In this paper, the performance of ACO is improved and the improved ACO is combined with heuristic algorithm to solve the multicast routing problem. Simulation shows that the results of this algorithm for multicast routing are better than the heuristic algorithms; this algorithm is also well suited for parallel implementation and execution
Keywords
multicast communication; optimisation; telecommunication network routing; ant colony optimization; heuristic algorithm; multicast routing; parallel implementation; stagnation; Ant colony optimization; Automatic control; Automation; Cities and towns; Communication networks; Costs; Heuristic algorithms; Multicast algorithms; Multimedia communication; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2000. IEEE APCCAS 2000. The 2000 IEEE Asia-Pacific Conference on
Conference_Location
Tianjin
Print_ISBN
0-7803-6253-5
Type
conf
DOI
10.1109/APCCAS.2000.913404
Filename
913404
Link To Document