By Topic

A hybrid algorithm applied to travelling salesman problem

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

1 Author(s)
Zne-Jung Lee ; Dept. of Inf. Manage., Kang-Ning Junior Coll. of Med. Care & Manage., Taiwan

In this paper, a hybrid algorithm is proposed for travelling salesman problem (TSP). TSP, one of the vehicle route planning problems, is to minimize the cost of travel of a salesman in visiting all the cities in a given set, and return to the starting city. Basically, the proposed algorithm combines ant colony optimization (ACO) with genetic algorithm (GA) and can explore and exploit search spaces. It has both the advantage of ACO, the ability to find feasible solutions and to avoid premature convergence, and that of GA, the ability to avoid being trapped in local optima. The test results show that proposed algorithm finds optimum solutions effectively.

Published in:

Networking, Sensing and Control, 2004 IEEE International Conference on  (Volume:1 )

Date of Conference:

21-23 March 2004