Novel evolutionary Particle Swarm Optimization for Traveling Salesman Problem
Sun Xing-ming · Computer Engineering and Applications Journal · 2008
Inspired from the co-evolutionary,this paper proposes a new hybrid particle swarm evolutionary algorithm for solving the Traveling Salesman Problem(TSP),which is one of the most known NP hard problem.The algorithm adopts an effective code schema and defines a new addition operation of the particle’s position in order to exchange information among the particles.A mutation operator is designed to keep the population’s diversity.The experiments show that this algorithm has better convergence effectiveness.