Natural Computing

, Volume 9, Issue 1, pp 47–60 | Cite as

A memetic algorithm for the generalized traveling salesman problem

  • Gregory Gutin
  • Daniel Karapetyan


The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper is to present a new memetic algorithm for GTSP with a powerful local search procedure. The experiments show that the proposed algorithm clearly outperforms all of the known heuristics with respect to both solution quality and running time. While the other memetic algorithms were designed only for the symmetric GTSP, our algorithm can solve both symmetric and asymmetric instances.


Generalized traveling salesman problem Asymmetric generalized traveling salesman problem Memetic algorithm Genetic algorithm Local search 



We would like to thank Natalio Krasnogor for numerous useful discussions of earlier versions of the paper and Michael Basarab for helpful advice on memetic algorithms.


  1. Bang-Jensen J, Gutin G (2000) Digraphs: theory, algorithms and applications. Springer-Verlag, London, 754 ppGoogle Scholar
  2. Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A (2003) Transformations of generalized ATSP into ATSP. Oper Res Lett 31:357–365zbMATHCrossRefMathSciNetGoogle Scholar
  3. Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceeding of the international joint conference on artificial intelligence, pp 162–164Google Scholar
  4. Fischetti M, Salazar-González JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45 (3):378–394zbMATHCrossRefMathSciNetGoogle Scholar
  5. Fischetti M, Salazar-González JJ, Toth P (2002) The generalized traveling salesman and orientering problems. In: Gutin G , Punnen A (eds) The traveling salesman problem and its variations. Kluwer, DordrechtGoogle Scholar
  6. Gutin G (2003) Traveling salesman problems. In: Gross J, Yellen J (eds) Handbook of Graph theory. CRC Press, Boca RatonGoogle Scholar
  7. Gutin G, Punnen AP (eds) (2002) Traveling salesman problem and its variations. Kluwer, DordrechtzbMATHGoogle Scholar
  8. Gutin G, Yeo A (2003) Assignment problem based algorithms are impractical for the generalized TSP. Ausralas J Combinatorics 27:149–154zbMATHMathSciNetGoogle Scholar
  9. Hart WE, Krasnogor N, Smith JE (eds) (2004) Recent advances in memetic algorithms. Studies in fuzzyness and soft computing, vol 166. Springer, BerlinGoogle Scholar
  10. Johnson DS, McGeoch L (2002) Experimental analysis of heuristics for STSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer, DordrechtGoogle Scholar
  11. Johnson DS, Gutin G, McGeoch L, Yeo A, Zhang X, Zverovitch A (2002) Experimental analysis of heuristics for ATSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer, DordrechtGoogle Scholar
  12. Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Trans Evol Comput 9:474–488CrossRefGoogle Scholar
  13. Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) Some applications of the generalized travelling salesman problem. J Oper Res Soc 47(12):1461–1467zbMATHGoogle Scholar
  14. Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB (eds) (1985) Travelling salesman problem: a guided tour of combinatorial optimization. Wiley, ChichesterGoogle Scholar
  15. Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Glover F, Dorigo M (eds) New ideas in optimization. McGraw-Hill, New YorkGoogle Scholar
  16. Reinelt G (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3:376–384. Google Scholar
  17. Silberholz J, Golden B (2007) The generalized traveling salesman problem: a new genetic algorithm approach. In: Baker et al. (eds) Extending the horizons: advances in computing, optimization, and decision technologies, vol 37. Springer, Heidelberg, pp 165–181Google Scholar
  18. Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174:38–53zbMATHCrossRefMathSciNetGoogle Scholar
  19. Tasgetiren MF, Suganthan PN, Pan Q-K (2007) A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: GECCO ’07: proceedings of the 9th annual conference on genetic and evolutionary computation, pp 158–167Google Scholar
  20. Tsai H-K, Yang J-M, Tsai Y-F, Kao C-Y (2004) An evolutionary algorithms for large traveling salesman problems. IEEE Trans SMC B 34:1718–1729Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Royal HollowayUniversity of LondonEghamUK

Personalised recommendations