By Topic

Using Simulated Annealing and Ant Colony Hybrid Algorithm to Solve Traveling 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
$33 $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

3 Author(s)
Xu Zhihong ; Sch. of Comput. Sci. & Eng., Hebei Univ. of Technol., Tianjin, China ; Song Bo ; Guo Yanyan

This paper discussed the parallel methods to implement the ant colony algorithm, the simulated annealing and their hybrid algorithm, established a cluster of PCs system, and tested the parallel algorithms in MPI. Based on the theoretic and practical study, the performance differences between parallel algorithms and traditional algorithms were analyzed, the feasibility of proceeding parallel algorithm to solve TSP in cluster of PCs was discussed and some meaningful conclusions about parallel efficiency were achieved.

Published in:

Intelligent Networks and Intelligent Systems, 2009. ICINIS '09. Second International Conference on

Date of Conference:

1-3 Nov. 2009