An Adaptive Mutation Multi-particle Swarm Optimization for Traveling Salesman Problem

作者：Gao Ming fang^*; Fu Xue liang; Dong Gai fang; Li Hong hui

来源：3rd International Conference on Material, Mechanical and Manufacturing Engineering (IC3ME), 2015-06-27 to 2015-06-28.

• Particle Swarm Optimization
• Adaptive mutation
• Multi-particle swarm
• Traveling Salesman Problem

Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem. The Particle Swarm Optimization has been proven to succeed in lots of problems, but the PSO algorithm is challenging due to a variety of factors such as easy to fall into local optimal solution and the convergence speed is slow in the later. In this paper, we propose an adaptive mutation multi-particle swarm optimization algorithm (AMPSO) to the TSP. The experimental results show that the proposed algorithm can achieves better performance compared to the standard PSO method to solve the TSP.

• 出版日期2015
• 单位内蒙古农业大学