Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation.

[1]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[2]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[3]  Schloss Birlinghoven.  Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .

[4]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[7]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[8]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[11]  Bikash Sinha,et al.  Physics and Astrophysics of Quark-Gluon Plasma: Proceedings of the Second International Conference , 1994 .

[12]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[13]  B. R. Fox,et al.  Genetic Operators for Sequencing Problems , 1990, FOGA.

[14]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[15]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[16]  Balamurali Krishna Ambati,et al.  Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem , 2004, Biological Cybernetics.

[17]  R. Brady.  Optimization strategies gleaned from biological evolution , 1985, Nature.

[18]  SpillmanRichard,et al.  Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers , 1993 .

[19]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[20]  Richard Spillman,et al.  Use of a genetic algorithm in the crypt-analysis of simple substitution ciphers , 1993 .

[21]  Heinz Mühlenbein,et al.  New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..

[22]  Gunar E. Liepins,et al.  A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.

[23]  W. Vent,et al.  Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[24]  Pedro Larrañaga,et al.  Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms , 1997, Stat. Comput..

[25]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

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

[27]  Sam Kwong,et al.  Genetic algorithms and their applications , 1996, IEEE Signal Process. Mag..

[28]  Gunar E. Liepins,et al.  Greedy Genetics , 1987, International Conference on Genetic Algorithms.

[29]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[30]  D. Fogel.  An evolutionary approach to the traveling salesman problem , 1988, Biological Cybernetics.

[31]  Balamurali Krishna Ambati,et al.  Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem , 2004, Biological Cybernetics.

[32]  Dirk Van Gucht,et al.  Incorporating Heuristic Information into Genetic Search , 1987, International Conference on Genetic Algorithms.

[33]  Maurizio Rebaudengo,et al.  Hybrid Genetic Algorithms for the Travelling Salesman Problem , 1993 .

[34]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[35]  Pedro Larrañaga,et al.  Partitional Cluster Analysis with Genetic Algorithms: Searching for the Number of Clusters , 1998 .

[36]  Pedro Larrañaga,et al.  Learning Bayesian network structures by searching for the best ordering with genetic algorithms , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[37]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[38]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[39]  Hans-Georg Beyer,et al.  Some Aspects of the 'Evolution Strategiy' for Solving TSP-Like Optimization Problems Appearing at the Design Studies of a 0.5 TeV e+e--Linear Collider , 1992, Parallel Problem Solving from Nature.

[40]  John A. Gunnels,et al.  Genetic algorithms and simulated annealing for gene mapping , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[41]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[42]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[43]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[44]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[45]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[46]  Dirk Van Gucht,et al.  The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .

[47]  Robert A. J. Matthews,et al.  The Use of Genetic Algorithms in Cryptanalysis , 1993, Cryptologia.

[48]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[49]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[50]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[52]  Darrell Whitley,et al.  The Travelling Salesman and Sequence Scheduling: Quality Solutions using Genetic Edge Recombination , 1990 .

[53]  박철훈,et al.  Genetic Algorithm를 이용한 Traveling Salesman Problem 해법 , 1992 .

[54]  D. Fogel.  Applying evolutionary programming to selected traveling salesman problems , 1993 .