Improved Particle Swarm Optimization For Traveling Salesman Problem

Abstract

To compensate for the shortcomings of existing methods used in TSP (Traveling Salesman Problem), such as the accuracy of solutions and the scale of problems, this paper proposed an improved particle swarm optimization by using a self-organizing construction mechanism and dynamic programming algorithm. Particles are connected in way of scale-free fully informed network topology map. Then dynamic programming algorithm is applied to realize the evolution and information exchange of particles. Simulation results show that the proposed method with good stability can effectively reduce the error rate and improve the solution precision while maintaining a low computational complexity.