Discrete Particle Swarm Optimization Algorithm for TSP Problem
Yiwen Zhong, Jiangang Yang · Systems Engineering - Theory & Practice · 2006
A discrete particle swarm optimization algorithm is designed to tackle the Traveling Salesman Problem.Based on the characteristics of the problem at hand and discrete variable,this paper redefines particle's position,velocity and their operation rules.In order to restrain premature stagnation,individual diversity of particle and micro-diversity of particle swarm are defined.A repulsion operator is designed to keep the diversity of particle swarm,and an efficient learning operator is defined to improve the algorithm's intensification ability.Using those operators,the proposed algorithm can get good balance between exploration and exploitation.The simulation results comparing with typical algorithms from the literature show that it can produce good results.