Chained Lin-Kernighan for Large Traveling Salesman Problems

By David L. Applegate, W. Cook, André Rohe. INFORMS journal on computing, 2003

376 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A comprehensive benchmark set and heuristics for the traveling thief problem (2014, methodology): “First, we use the Chained Lin-Kernighan heuristic [3] to quickly construct a good TSP tour.”
Iterated Local Search (2001, methodology): “This kind of test was also performed for ILS applied to the TSP [2].”
General k-opt submoves for the Lin–Kernighan TSP heuristic (2009, methodology): “To kick the tour the double-bridge move (see Fig. 4 )i s often used [2, 4 ,27].”
Ant Colony Optimization (2001, neutral): “These include tabu search (Knox, 1994; Zachariasen & Dam, 1996), guided local search (Voudouris & Tsang, 1999), evolutionary algorithm (Merz & Freisleben, 1997; Walters, 1998), ACO algorithms (see this chapter and Stützle & Dorigo, 1999b), and iterated local search (ILS) (Baum, 1986; Martin et al., ”
K-Profiles: A Nonlinear Clustering Method for Pattern Detection in High Dimensional Data (2015, methodology): “We used the efficient TSP R library to compute the cluster profiles [19].”