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

被引：240

作者：

Helsgaun K. ^{[1
]}

机构：

[1] Department of Communication, Business and Information Technologies, Roskilde University

来源：

Mathematical Programming Computation | 2009年 / 1卷 / 2-3期

关键词：

K-opt; Lin-Kernighan; Traveling salesman problem; TSP;

D O I：

10.1007/s12532-009-0004-6

中图分类号：

学科分类号：

摘要：

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. © Springer and Mathematical Programming Society 2009.

引用

页码：119 / 163

页数：44

共 34 条

[11]

Gutin G., Punnen A.P., Traveling Salesman Problem and Its Variations, (2002)

[12]

Hanlon P.J., Stanley R.P., Stembridge J.R., Some combinatorial aspects of the spectra of normally distributed random matrices, Contemp. Math., 138, pp. 151-174, (1992)

[13]

Hannenhalli S., Pevzer P.A., Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals, Proceedings of the 27th ACM-SIAM Symposium on Theory of Computing, pp. 178-189, (1995)

[14]

Held M., Karp R.M., The traveling-salesman problem and minimum spanning trees, Oper. Res., 18, pp. 1138-1162, (1970)

[15]

Held M., Karp R.M., The traveling-salesman problem and minimum spanning trees: Part II, Math. Prog., 1, pp. 6-25, (1971)

[16]

Helsgaun K., An effective implementation of the Lin-Kernighan traveling salesman heuristic, EJOR, 12, pp. 106-130, (2000)

[17]

Hoos H.H., Stutzle T., Stochastic Local Search: Foundations and Applications, (2004)

[18]

Johnson D.S., Local optimization and the traveling salesman problem, LNCS, 442, pp. 446-461, (1990)

[19]

Johnson D.S., McGeoch L.A., Rothberg E.E., Asymptotic experimental analysis for the Held-Karp traveling salesman bound, Proceedings of 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 341-350, (1996)

[20]

Johnson D.S., McGeoch L.A., The traveling salesman problem: A case study in local optimization, Local Search in Combinatorial Optimization, pp. 215-310, (1997)

← 1 2 3 4 →