旅行商问题的交叉粒子群优化算法

CROSSOVER PARTICLE SWARM OPTIMIZATION FOR TRAVELING SALESMAN PROBLEM

本文将粒子群优化算法(PSO)应用于求解旅行商问题(TSP),结合遗传算法的交叉算子,建立了求解此问题的交叉粒子群优化算法,数值模拟结果表明了该算法的有效性.

This paper introduces the particle swarm optimization （PSO） to deal with the traveling salesman problem （TSP）, and proposes a novel crossover particle swarm optimi.zation combining the ideal of the genetic algorithm. The effectiveness of the algorithm is proved by experiments.