A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem

In this paper, we are addressing the generalized traveling salesman problem, denoted by GTSP, which is a variant of the classical traveling salesman problem (TSP). The GTSP is characterized by the fact that the vertices of the graph are partitioned into a given number of clusters and we are looking for the minimum cost tour that visits exactly one vertex from each cluster. The goal of this paper is to present a novel method for solving the GTSP, namely a hybrid diploid genetic based algorithm. The preliminary computational results on an often set of benchmark instances show that our proposed approach provides competitive solutions compared to the existing state-of-the-arts methods for solving the GTSP.

[1]  Petrica C. Pop,et al.  A hybrid heuristic approach for solving the generalized traveling salesman problem , 2011, GECCO '11.

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

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

[4]  Petrica C. Pop,et al.  A Sensitive Metaheuristic for Solving a Large Optimization Problem , 2008, SOFSEM.

[5]  James A. Chisman,et al.  The clustered traveling salesman problem , 1975, Comput. Oper. Res..

[6]  Gilbert Laporte,et al.  Generalized network design problems , 2003, Eur. J. Oper. Res..

[7]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[8]  Gregory Gutin,et al.  Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem , 2010, Eur. J. Oper. Res..

[9]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the generalized traveling salesman problem , 2007, GECCO '07.

[10]  Petrica C. Pop,et al.  NEW INTEGER PROGRAMMING FORMULATIONS OF THE GENERALIZED TRAVELING SALESMAN PROBLEM , 2007 .

[11]  Petrica C. Pop,et al.  Generalized network design problems : modeling and optimization , 2012 .

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

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

[14]  Oliviu Matei,et al.  An efficient genetic algorithm for solving the generalized traveling salesman problem , 2010, Proceedings of the 2010 IEEE 6th International Conference on Intelligent Computer Communication and Processing.

[15]  Petrica C. Pop,et al.  The generalized traveling salesman problem solved with ant algorithms , 2013, Complex Adapt. Syst. Model..

[16]  Petrica C. Pop,et al.  Sensitive Ants in Solving the Generalized Vehicle Routing Problem , 2011, Int. J. Comput. Commun. Control.

[17]  Petrica C. Pop,et al.  A New Approach for Solving the Generalized Traveling Salesman Problem , 2010, Hybrid Metaheuristics.

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

[19]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

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

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

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

[23]  Binay K. Bhattacharya,et al.  Approximation Algorithms for Generalized MST and TSP in Grid Clusters , 2015, COCOA.

[24]  Keld Helsgaun,et al.  Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm , 2015, Mathematical Programming Computation.

[25]  Bruce L. Golden,et al.  The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach , 2007 .

[26]  Daniel Karapetyan,et al.  An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem , 2012, Algorithmic Oper. Res..