Simulated Annealing for Finding TSP Lower Bound

  • Łukasz Strąk
  • Wojciech Wieczorek
  • Arkadiusz Nowakowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10449)


Held and Karp’s theory has been proposed in the early 1970s in order to estimate an optimal tour length for the Travelling Salesman Problem. The ascent method, which is based on this theory, makes it possible to obtain a graph, which contains a large number of edges common with the optimal solution. In this article, we presents a new algorithm of simulated annealing for the same purpose. Our approach improves the quality of obtained results and makes it possible to receive a greater number of edges common with the optimal solution. The ascent method, suggested by Helsgaun, was applied for comparison since it is well documented, achieves good results and has an available implementation.


Held-Karp Simulated annealing TSP 


  1. 1.
    Helsgaun, K.: Eur. J. Oper. Res. 126, 106–130 (2000)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Goemans, M.X., Bertsimas, D.J.: Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. Math. Oper. Res. 16(1), 72–89 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Valenzuela, C.L., Jones, A.J.: Estimating the Held-Karp lower bound for the geometric TSP. Eur. J. Oper. Res. 102(1), 157–175 (1997)CrossRefGoogle Scholar
  4. 4.
    Johnson, D.S., McGeoch, L.A., Rothberg, E.E.: Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996, Philadelphia, PA, USA, pp. 341–350. Society for Industrial and Applied Mathematics (1996)Google Scholar
  5. 5.
    Westerlund, A., Göthe-Lundgren, M., Larsson, T.: A note on relatives to the Held and Karp 1-tree problem. Oper. Res. Lett. 34(3), 275–282 (2006)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Karp, R.M., Held, M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138–1162 (1970)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6–25 (1971)CrossRefGoogle Scholar
  8. 8.
    Polyak, B.T.: A general method of solving extremum problems. Dokl. Akad. Nauk SSSR 174(1), 33 (1967)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Helsgaun, K.: An effective implementation of k-opt moves for the Lin-Kernighan TSP heuristic. Technical report, Roskilde University (2006)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Łukasz Strąk
    • 1
  • Wojciech Wieczorek
    • 1
  • Arkadiusz Nowakowski
    • 1
  1. 1.Institute of Computer ScienceUniversity of Silesia in KatowiceSosnowiecPoland

Personalised recommendations