Using Simulated Annealing and Ant Colony Hybrid Algorithm to Solve Traveling Salesman Problem

Author

Zhihong, Xu ; Bo, Song ; Yanyan, Guo

Author_Institution

Sch. of Comput. Sci. & Eng., Hebei Univ. of Technol., Tianjin, China

fYear

2009

fDate

1-3 Nov. 2009

Firstpage

507

Lastpage

510

Abstract

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.

Keywords

application program interfaces; parallel algorithms; simulated annealing; travelling salesman problems; MPI; TSP; ant colony algorithm; ant colony hybrid algorithm; parallel methods; proceeding parallel algorithm; simulated annealing; solve traveling salesman problem; Algorithm design and analysis; Clustering algorithms; Computational modeling; Computer simulation; Intelligent networks; Parallel algorithms; Partitioning algorithms; Simulated annealing; Solids; Traveling salesman problems; ant colony algorithm; cluster of PCs; hybrid algorithm; simulated annealing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Tianjin

Print_ISBN

978-1-4244-5557-7

Electronic_ISBN

978-0-7695-3852-5

Type

conf

DOI

10.1109/ICINIS.2009.135

Filename

5363410