Analysis of Ant Colony Algorithms in Network Routing Problems
Ant Colony (ACO) algorithm simulates the phenomena that a swarm of ants in the search for food and shows the remarkable capability of finding shortest paths between a found food source and the anthill. it is introduced as a population-based evolutionary optimization technique. ACO is known as a problem solver for Combinatorial Optimization(CO) problems. In this paper, we discuss the applicability of ACO to a well-known CO problem,Network Routing problem. We compare the ACO-based Routing algorithm with traditional methods and provide the performance comparison between these algorithms. Some new ideas and possible research direction in network routing problem are provided in the last section of the paper.
Ant Colony Swarm Intelligence Routing and Combinatorial Optimization
HongBin Xia
School of Information Technology, Southern Yangtze University, Wuxi 214036, China
国际会议
杭州
英文
1081-1083
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）