An Improved Design of Particle Swarm Optimization to Solve the Traveling Salesman Problem
Shuang Na · Computer Era · 2009
This paper uses a new coding method based on the priority to apply Particle Swarm Optimization(PSO) algorithm oriented to continuous optimization problems in solving Traveling Salesman Problem(TSP).And the easy operation and high efficiency of the PSO are reserved.Then an innovative approach based on k-means algorithm is proposed with purpose of preventing PSO algorithm from local optimization.The k-means algorithm is used to execute cluster analysis on the particle swarm,which make particles exchange information with each other and search the best solution in a larger solution space than ever,so as to prevent the algorithm from local optimization.