Lin–Kernighan heuristic

From Wikipedia, the free encyclopedia
  (Redirected from Lin–Kernighan)
Jump to: navigation, search
This article is about the heuristic for the travelling salesman problem. For a heuristic algorithm for the graph partitioning problem, see Kernighan–Lin algorithm.

In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean travelling salesman problem. Briefly, it involves swapping pairs of sub-tours to make a new tour. It is a generalization of 2-opt and 3-opt. 2-opt and 3-opt work by switching two or three paths to make the tour shorter. Lin–Kernighan is adaptive and at each step decides how many paths between cities need to be switched to find a shorter tour.

See also[edit]

References[edit]

External Links[edit]