A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems

The combination of local search heuristics and genetic algorithms is a promising approach for finding near-optimum solutions to the traveling salesman problem (TSP). An approach is presented in which local search techniques are used to find local optima in a given TSP search space, and genetic algorithms are used to search the space of local optima in order to find the global optimum. New genetic operators for realizing the proposed approach are described, and the quality and efficiency of the solutions obtained for a set of symmetric and asymmetric TSP instances are discussed. The results indicate that it is possible to arrive at high quality solutions in reasonable time.

[1]  Luca Maria Gambardella,et al.  Results of the first international contest on evolutionary optimisation (1st ICEO) , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  L. Darrell Whitley,et al.  Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem , 1992, PPSN.

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

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

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

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Kwong-Sak Leung,et al.  A Modified Edge Recombination Operator for the Travelling Salesman Problem , 1994, PPSN.

[8]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[9]  Richard Szeliski,et al.  An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.

[10]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[11]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[12]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[13]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[14]  Heinz Mühlenbein,et al.  Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.

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

[16]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[17]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[18]  H. P. Stehouwer,et al.  Neural Networks and the Travelling Salesman Problem , 1993 .

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

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

[21]  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 .

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

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

[24]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[25]  Kenneth D. Boese,et al.  Cost Versus Distance In the Traveling Salesman Problem , 1995 .

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

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

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