General k-opt submoves for the Lin-Kernighan TSP heuristic

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This paper presents an effective implementation of k-opt in LKH-2, a variant of the Lin–Kernighan TSP heuristic. The effectiveness of the implementation is demonstrated with experiments on Euclidean instances ranging from 10,000 to 10,000,000 cities. The runtime of the method increases almost linearly with the problem size. LKH-2 is free of charge for academic and non-commercial use and can be downloaded in source code.
Original languageEnglish
JournalMathematical Programming Computation
Volume1
Issue number2-3
Pages (from-to)119-163
ISSN1867-2949
DOIs
Publication statusPublished - 2009

Keywords

  • Traveling salesman problem
  • TSP
  • Lin-Kernighan
  • k-opt

Cite this