Research and Improvement of Ant Colony Algorithm Based on TSP
Ant colony algorithm is a new algorithm of heuristic bionic calculation. Now, it has been .widely applied in many fields of combinatorial optimization. This paper elaborates the basic principle and mathematical model of typical ant colony algorithm for solving the traveling salesman problem, and analyzes impact of the optimal parameters to the performance of algorithm. Based on its shortages, an improved algorithm by dynamically adjusting parameters is proposed. Finally, the paper gives the simulation result, and it indicates the improved algorithm has a better performance.
ant colony algorithm traveling salesman problem dynamically adjust parameters
Ling Lin Huailin Dong Qingfeng Wu Tianmao Xu
Software School Xiamen University Xiamen, China
国际会议
重庆
英文
956-959
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）