Particle Swarm for the Traveling Salesman Problem

This paper presents a competitive Particle Swarm Optimization algorithm for the Traveling Salesman Problem, where the velocity operator is based upon local search and path-relinking procedures. The paper proposes two versions of the algorithm, each of them utilizing a distinct local search method. The proposed heuristics are compared with other Particle Swarm Optimization algorithms presented previously for the same problem. The results are also compared with three effective algorithms for the TSP. A computational experiment with benchmark instances is reported. The results show that the method proposed in this paper finds high quality solutions and is comparable with the effective approaches presented for the TSP.

[1]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1998 .

[2]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[3]  R. Reynolds.  AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[4]  Ulf Grenander,et al.  A stochastic nonlinear model for coordinated bird flocks , 1990 .

[5]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[6]  Heitor Silvério Lopes,et al.  A hybrid particle swarm optimization model for the traveling salesman problem , 2005 .

[7]  Paul D. Seymour,et al.  Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..

[8]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[9]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[10]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[11]  Wei Pang,et al.  Modified particle swarm optimization based on space transformation for solving traveling salesman problem , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[13]  Godfrey C. Onwubolu,et al.  Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization , 2004 .

[14]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[15]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[18]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[19]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[20]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[21]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..