Intelligent Optimization Study of Traveling Salesman Problem

Article Preview

Abstract:

Ant colony optimization algorithm is a new simulated evolutionary algorithm by simulating the ant routing behavior of the natural world. In this paper, the basic principle of ant colony algorithm is applied to the classic TSP problem. Simulation examples show that the ant colony algorithm has better robustness and can quickly find the optimal solution.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1906-1908

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhang Hongda Zheng Quandi: Based on the TSP simulation study of ant colony algorithm . Aviation Computing Technology (2005), pp.21-24.

Google Scholar

[2] Hu Xiaobing, HUANG Xi-yue : Solved TSP problem based on ant colony algorithm . Science and Technology Information(2010), pp.45-52.

Google Scholar

[3] Wang Lei, Wu Qidi: Ant colony algorithm for continuous space optimization problem. Control and Decision Vol. 18(2003), pp.30-32.

Google Scholar

[4] Duan Haibin: Ant colony algorithm and its application(2005). pp.40-58.

Google Scholar