Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP

Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuristic (LKH) for the Symmetric TSP (STSP). The LKH appears to exceed the performance of all STSP heuristic algorithms proposed to date. In this paper we improve Helsgaun's LKH based on an approximation of Zhang and Looks' backbones and an extension of double bridges further combined with implementation details by all of which we guide the search process instead of Helsgaun's -values. Our computational results are competitive and lead to improved solutions for some of the VLSI instances announced at the TSP homepage.

• Type: Conference
• Year: 2007
• Where: CAAN
• Authors: Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
• Keywords: CAAN 2007, Discrete Geometry, Lin-Kernighan Heuristic, STSP Heuristic Algorithms, Symmetric TSP