Optimization Techniques for Solving Travelling Salesman Problem

In the traveling salesman problem (TSP) we wish to find a tour of all nodes in a weighted graph so that the total weight is minimized. The traveling salesman problem is NP-hard but has many real world applications so a good solution would be useful. In this paper, we present several modern optimization techniques to find the shortest tour through all cities (nodes). Genetic Algorithm (GA), Simulated Annealing (SA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Bacteria Foraging Optimization (BFO), and Bee Colony Optimization (BCO) are applied on several datasets of TSP with different number of cities and different representation: distances between cities, or coordinates of cities. Each optimization technique has unique behaviors which survives it against other techniques. In this paper, the results and comparative study will present for each dataset to calculate the minimum distance and plat the resultant path. Keywords— Genetic Algorithm, Simulated Annealing, Particle Swarm Optimization, Ant Colony Optimization, Bacteria Foraging Optimization, Bee Colony Optimization, traveling salesman problem.

[1]  Stefan Näher,et al.  The Travelling Salesman Problem , 2011, Algorithms Unplugged.

[2]  Khalid W. Magld,et al.  Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover , 2012 .

[3]  Ahmed Bensenouci,et al.  PID controllers design for a power plant using Bacteria Foraging Algorithm , 2011, 2011 Saudi International Electronics, Communications and Photonics Conference (SIECPC).

[4]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[5]  Karan Bhatia,et al.  Genetic Algorithms and the Traveling Salesman Problem , 1994 .

[6]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

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

[8]  John R. Koza,et al.  Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .

[9]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Gerhard Reinelt,et al.  The Traveling Salesman , 2001, Lecture Notes in Computer Science.

[11]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[12]  Adewole Philip,et al.  A Genetic Algorithm for Solving Travelling Salesman Problem , 2011 .

[13]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[14]  Li Feng,et al.  Study of Adaptive PID Controller Based on Single Neuron and Genetic Optimization , 2007, 2007 8th International Conference on Electronic Measurement and Instruments.

[15]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[16]  V. Isaeva.  Self-organization in biological systems , 2012, Biology Bulletin.

[17]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[18]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[19]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[20]  Colin R. Reeves,et al.  Using Genetic Algorithms with Small Populations , 1993, ICGA.

[21]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[22]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[23]  Madan Lal Mittal,et al.  Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches , 2010 .

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

[25]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[26]  Gunar E. Liepins,et al.  Schema Analysis of the Traveling Salesman Problem Using Genetic Algorithms , 1992, Complex Syst..

[27]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.