Simulated Annealing for Finding TSP Lower Bound
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.
KeywordsHeld-Karp Simulated annealing TSP
- 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
- 9.Helsgaun, K.: An effective implementation of k-opt moves for the Lin-Kernighan TSP heuristic. Technical report, Roskilde University (2006)Google Scholar