Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm
Xuesong Yan, Can Zhang, Wenjing Luo, Wei Li, Wei Chen, Hanmin Liu · 2012
The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. Compared with the genetic algorithm, PSO algorithm has high convergence speed. In this paper, aim at the disadvantages of genetic algorithm like being trapped easily into a local optimum, we use the PSO algorithm to solve the TSP and the experiment results show the new algorithm is effective for the this problem.