Skip to main content
SpringerLink
Log in

Simulated Annealing for Finding TSP Lower Bound

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10449))

Included in the following conference series:

  • 2087 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Helsgaun, K.: Eur. J. Oper. Res. 126, 106–130 (2000)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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. 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)

    Article  MathSciNet  Google Scholar 

  6. Karp, R.M., Held, M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138–1162 (1970)

    Article  MathSciNet  Google Scholar 

  7. Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6–25 (1971)

    Article  Google Scholar 

  8. Polyak, B.T.: A general method of solving extremum problems. Dokl. Akad. Nauk SSSR 174(1), 33 (1967)

    MathSciNet  MATH  Google Scholar 

  9. Helsgaun, K.: An effective implementation of k-opt moves for the Lin-Kernighan TSP heuristic. Technical report, Roskilde University (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia in Katowice, Będzińska 39, 41-205, Sosnowiec, Poland

    Łukasz Strąk, Wojciech Wieczorek & Arkadiusz Nowakowski

Authors
  1. Łukasz Strąk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Wieczorek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arkadiusz Nowakowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Łukasz Strąk .

Editor information

Editors and Affiliations

  1. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Department of Computer Science, University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  3. Department of Information Systems, Gdynia Maritime University, Gdynia, Poland

    Piotr Jędrzejowicz

  4. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

  5. Department of Information Systems, University of Münster, Münster, Germany

    Gottfried Vossen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Strąk, Ł., Wieczorek, W., Nowakowski, A. (2017). Simulated Annealing for Finding TSP Lower Bound. In: Nguyen, N., Papadopoulos, G., Jędrzejowicz, P., Trawiński, B., Vossen, G. (eds) Computational Collective Intelligence. ICCCI 2017. Lecture Notes in Computer Science(), vol 10449. Springer, Cham. https://doi.org/10.1007/978-3-319-67077-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67077-5_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67076-8

  • Online ISBN: 978-3-319-67077-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation