A novel approach to solve Graph based Travelling Salesman Problem using Particle Swarm Optimization technique

This paper presents a Discrete Particle Swarm Optimization (DPSO) technique to solve Graph based Travelling Salesman Problem (TSP). TSP can be represented as a graph where nodes represent cities and edges represent paths between them. A partially connected graph addresses a more realistic problem than a completely connected graph since in real life paths may not exist between certain cities. A novel approach to DPSO is used to obtain results in this situation. Convergence of DPSO to the optimal solution for such a Graph based TSP is tasted.

[1]  William J. Cook,et al.  Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..

[2]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[3]  Hamed Shah-Hosseini,et al.  The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm , 2009, Int. J. Bio Inspired Comput..

[4]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[5]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

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

[7]  Chi-Hwa Song,et al.  Extended simulated annealing for augmented TSP and multi-salesmen TSP , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[8]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.