关键词: 粒子群算法, 进化计算, 旅行商问题

Abstract: 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.

Key words: particle swarm algorithm, evolutionary computation, Traveling Salesman Problem（TSP）