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

The intelligent optimization algorithms for solving TSP mainly include ant colony algorithm and simulated annealing,etc.These algorithms have significant advantages and run faster than traditional exact algorithms.But,the speed is often impossible to meet people's need as the scale of TSP increase gradually.For the problem,this paper discussed the parallel methods to implement the ant colony algorithm,the simulated annealing and the 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.