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

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.