A New Approach for Solving the Generalized Traveling Salesman Problem

The generalized traveling problem (GTSP) is an extension 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. Based on this approach we describe a novel hybrid metaheuristic algorithm for solving the problem using genetic algorithms. Computational results are reported for Euclidean TSPlib instances and compared with the existing ones. The obtained results point out that our hybrid algorithm is an appropriate method to explore the search space of this complex problem and leads to good solutions in a reasonable amount of time.

[1]  M. Marchese,et al.  An ant colony optimization method for generalized TSP problem , 2008 .

[2]  Matteo Fischetti,et al.  The symmetric generalized traveling salesman polytope , 1995, Networks.

[3]  Christian Artigues,et al.  A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem , 2008, Comput. Oper. Res..

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

[5]  Gilbert Laporte,et al.  Some Applications of the Generalized Travelling Salesman Problem , 1996 .

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

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

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

[9]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

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

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

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

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

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

[15]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

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

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

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

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

[20]  Günther R. Raidl,et al.  Effective Neighborhood Structures for the Generalized Traveling Salesman Problem , 2008, EvoCOP.