This paper presents a hybrid discrete particle swarm optimization (HDPSO) for solving the traveling salesman problem (TSP). The HDPSO combines a new discrete particle swarm optimization (DPSO) with a local search. DPSO is an approach designed for the TSP based on the binary version of particle swarm optimization. Unlike in general versions of particle swarm optimization, DPSO redefines the particle's position and velocity, and then updates its state by using a tour construction. The embedded local search is implemented to improve the solutions generated by DPSO. The experimental results on some instances are reported and indicate HDPSO can be used to solve TSPs.
['Xiangyong Li', 'Peng Tian', 'Jing Hua', 'Ning Zhong']
A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem