An efficient genetic algorithm for solving the generalized traveling salesman problem

The generalized traveling salesman problem (GTSP) is a generalization of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem and as well an efficient algorithm for solving the problem based on genetic algorithms. Computational results are reported for Euclidean TSPlib instances and compared with the existing ones. The obtained results point out that our GA is an appropriate method to explore the search space of this complex problem and leads to good solutions in a short amount of time.

[1]  Petrica C. Pop,et al.  A new relaxation method for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..

[2]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[3]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[4]  Markus Leitner,et al.  Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem , 2008, J. Heuristics.

[5]  G. Laporte,et al.  Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .

[6]  Petrica C. Pop,et al.  Exact Algorithms for Generalized Combinatorial Optimization Problems , 2007, COCOA.

[7]  P. C. POP.  A survey of different integer programming formulations of the generalized minimum spanning tree problem , 2009 .

[8]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[9]  Petrica C. Pop,et al.  A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem , 2010, HAIS.

[10]  Jacques Renaud,et al.  An efficient composite heuristic for the symmetric generalized traveling salesman problem , 1998, Eur. J. Oper. Res..

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

[12]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[13]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[14]  Gregory Gutin,et al.  A memetic algorithm for the generalized traveling salesman problem , 2008, Natural Computing.

[15]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[16]  David B. Fogel.  Evolutionary Computation: Principles and Practice for Signal Processing , 2004 .

[17]  P. Pop.  The generalized minimum spanning tree problem , 2000 .

[18]  Gilbert Laporte,et al.  Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..