Advertisement

Mathematical Programming Computation

, Volume 7, Issue 3, pp 269–287 | Cite as

Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm

  • Keld HelsgaunEmail author
Full Length Paper

Abstract

The equality generalized traveling salesman problem (E-GTSP) is an extension of the traveling salesman problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit every cluster exactly once. It is well known that any instance of E-GTSP can be transformed into a standard asymmetric instance of the TSP, and therefore solved with a TSP solver. This paper evaluates the performance of the state-of-the art TSP solver Lin–Kernighan–Helsgaun (LKH) on transformed E-GTSP instances. Although LKH is used without any modifications, the computational evaluation shows that all instances in a well-known library of benchmark instances, GTSPLIB, could be solved to optimality in a reasonable time. In addition, it was possible to solve a series of new very-large-scale instances with up to 17,180 clusters and 85,900 vertices. Optima for these instances are not known but it is conjectured that LKH has been able to find solutions of a very high quality. The program’s performance has also been evaluated on a large number of instances generated by transforming arc routing problem instances into E-GTSP instances. The program is free of charge for academic and non-commercial use and can be downloaded in source code.

Keywords

Equality generalized traveling salesman problem E-GTSP Traveling salesman problem TSP Lin–Kernighan  Heuristics Arc routing problems 

Mathematics Subject Classification

90C27 90C35 90C59 

References

  1. 1.
    Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. J. Oper. Res. Soc. 47(12), 1461–1467 (1996)zbMATHCrossRefGoogle Scholar
  2. 2.
    Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR 31(1), 39–44 (1993)zbMATHGoogle Scholar
  3. 3.
    Behzad. A., Modarres, M.: A New efficient transformation of generalized traveling salesman problem into traveling salesman problem. In: Proceedings of the 15th International Conference of Systems Engineering, ICSE (2002)Google Scholar
  4. 4.
    Ben-Arieh, D., Gutin, G., Penn, M., Yeo, A., Zverovitch, A.: Transformations of generalized ATSP into ATSP. Oper. Res. Lett. 31(5), 357–365 (2003)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Laporte, G., Semet, F.: Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem. INFOR 37(2), 114–120 (1999)Google Scholar
  6. 6.
    Karapetyan, D., Gutin, G.: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2), 234–251 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Helsgaun, K.: An effective implementation of the Lin–Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Helsgaun, K.: General \(k\)-opt submoves for the Lin–Kernighan TSP heuristic. Math. Prog. Comput. 1(2–3), 119–163 (2009)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498–516 (1973)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Reinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)zbMATHCrossRefGoogle Scholar
  11. 11.
    Fischetti, M., Salazar González, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378–394 (1997)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Fischetti, M., SalazarGonzález, J.J., Toth, P.: The generalized traveling salesman and orientering problems. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and its Variations, pp. 602–662. Kluwer, Dordrecht (2002)Google Scholar
  13. 13.
    Johnson, D.S., McGeoch, L.A., Glover, F., Rego, C.: 8th DIMACS implementation challenge: the traveling salesman problem (2000). http://dimacs.rutgers.edu/Challenges/TSP/. Accessed 24 Apr 2015
  14. 14.
    National traveling salesman problems. http://www.math.uwaterloo.ca/tsp/world/countries.html. Accessed 24 Apr 2015
  15. 15.
    Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138–1162 (1970)zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1), 47–60 (2010)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Karapetyan, D., Gutin, G.: Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem. Eur. J. Oper. Res. 208(3), 221–232 (2011)zbMATHMathSciNetCrossRefGoogle Scholar
  18. 18.
    Blais, M., Laporte, G.: Exact solution of the generalized routing problem through graph transformations. J. Oper. Res. Soc. 54(8), 906–910 (2003)zbMATHCrossRefGoogle Scholar
  19. 19.
    Corberán, Á., Plana I., Sanchis, J.M.: Arc routing problems: data instances. http://www.uv.es/corberan/instancias.htm. Accessed 24 Apr 2015
  20. 20.
    Corberán, A., Oswald, M., Plana, I., Reinelt, G., Sanchis, J.M.: New results on the Windy Postman problem. Math. Program. Ser. A 132, 309–332 (2012)zbMATHCrossRefGoogle Scholar
  21. 21.
    Drexl, M.: On the generalized directed rural postman problem. J. Oper. Res. Soc. (2013). doi: 10.1057/jors.2013.60
  22. 22.
    Karapetyan, D., Gutin, G.: Generalized traveling salesman problem reduction algorithms. Algorithm Oper. Res. 4, 144–154 (2009)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society 2015

Authors and Affiliations

  1. 1.Computer ScienceRoskilde UniversityRoskildeDenmark

Personalised recommendations