An effective implementation of the Lin-Kernighan traveling salesman heuristic

被引：1660
|
作者：
Helsgaun, K [1 ]
机构：
[1] Roskilde Univ, Dept Comp Sci, DK-4000 Roskilde, Denmark
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 126卷 / 01期
关键词：
traveling salesman problem; heuristics; Lin-Kernighan;
D O I：
10.1016/S0377-2217(99)00284-2
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem (TSP). Computational tests show that the implementation is highly effective. It has found optimal solutions for all solved problem instances we have been able to obtain, including a 13,509-city problem (the largest non-trivial problem instance solved to optimality today). (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：106 / 130
页数：25
相关论文
共 50 条
  • [1] THE COMPLEXITY OF THE LIN-KERNIGHAN HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM
    PAPADIMITRIOU, CH
    SIAM JOURNAL ON COMPUTING, 1992, 21 (03) : 450 - 465
  • [2] A MODIFIED LIN-KERNIGHAN TRAVELING-SALESMAN HEURISTIC
    MAK, KT
    MORTON, AJ
    OPERATIONS RESEARCH LETTERS, 1993, 13 (03) : 127 - 132
  • [3] Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
    Karapetyan, D.
    Gutin, G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 208 (03) : 221 - 232
  • [4] Chained Lin-Kernighan for large traveling salesman problems
    Applegate, D
    Cook, W
    Rohe, A
    INFORMS JOURNAL ON COMPUTING, 2003, 15 (01) : 82 - 92
  • [5] Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic
    Tinos, Renato
    Helsgaun, Keld
    Whitley, Darrell
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT I, 2018, 11101 : 95 - 107
  • [6] The Lin-Kernighan Algorithm Driven by Chaotic Neurodynamics for Large Scale Traveling Salesman Problems
    Motohashi, Shun
    Matsuura, Takafumi
    Ikeguchi, Tohru
    Aihara, Kazuyuki
    ARTIFICIAL NEURAL NETWORKS - ICANN 2009, PT II, 2009, 5769 : 563 - +
  • [7] Decomposition-Based Lin-Kernighan Heuristic With Neighborhood Structure Transfer for Multi/Many-Objective Traveling Salesman Problem
    Cai, Xinye
    Wang, Kang
    Mei, Yi
    Li, Zhenhua
    Zhao, Jun
    Zhang, Qingfu
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (06) : 1604 - 1617
  • [8] Insertion based Lin-Kernighan heuristic for single row facility layout
    Kothari, Ravi
    Ghosh, Diptesh
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 129 - 136
  • [9] General k-opt submoves for the Lin-Kernighan TSP heuristic
    Helsgaun K.
    Mathematical Programming Computation, 2009, 1 (2-3) : 119 - 163
  • [10] A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents
    Yin, Zhaoming
    Tang, Jijun
    Schaeffer, Stephen W.
    Bader, David A.
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 227 - 238
12345