Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Solving the Travelling Salesman Problem by the Program of Ant Colony Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhu Ju-fang ; Chinese Acad. of Surveying & Mapping, Chinese Univ. of Min. & Technol., Beijing, China ; Li Qing-yuan

Ant colony algorithm is a novel simulated ecosystem evolutionary algorithm, which is applied to solving complex combinatorial optimization problems. The basic principle and realization about ant colony algorithm are studied in this paper. The algorithm is realized under the Visual C++ compiler environment, and applied to solving the travelling salesman problem (TSP). The result is accordance with the best route solution. This algorithm has practical worth.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009