The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem

被引：21

作者：

Hougardy, Stefan ^{[1
]}

Zaiser, Fabian ^{[1
]}

Zhong, Xianghui ^{[1
]}

机构：

[1] Univ Bonn, Res Inst Discrete Math, Lennestr 2, D-53113 Bonn, Germany

来源：

OPERATIONS RESEARCH LETTERS | 2020年 / 48卷 / 04期

关键词：

Traveling Salesman Problem; Metric TSP; 2-opt; Approximation algorithm; ALGORITHM;

D O I：

10.1016/j.orl.2020.05.007

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The 2-Opt heuristic is one of the simplest algorithms for finding good solutions to the metric Traveling Salesman Problem. It is the key ingredient to the well-known Lin-Kernighan algorithm and often used in practice. So far, only upper and lower bounds on the approximation ratio of the 2-Opt heuristic for the metric TSP were known. We prove that for the metric TSP with n cities, the approximation ratio of the 2-Opt heuristic is root n/2 and that this bound is tight. (C) 2020 Elsevier B.V. All rights reserved.

引用

页码：401 / 404

页数：4

共 50 条

[1] The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
Brodowsky, Ulrich A.
Hougardy, Stefan
[J]. 38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
[2] THE APPROXIMATION RATIO OF THE k-OPT HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
Brodowsky, Ulrich A.
Hougardy, Stefan
Zhong, Xianghui
[J]. SIAM JOURNAL ON COMPUTING, 2023, 52 (04) : 841 - 864
[3] Nonoblivious 2-Opt Heuristics for the Traveling Salesman Problem
Levin, Asaf
Yovel, Uri
[J]. NETWORKS, 2013, 62 (03) : 201 - 219
[4] A PARALLEL 2-OPT ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM
VERHOEVEN, MGA
AARTS, EHL
SWINKELS, PCJ
[J]. FUTURE GENERATION COMPUTER SYSTEMS, 1995, 11 (02) : 175 - 182
[5] Fourier descriptors for 2-Opt and 3-Opt heuristics for traveling salesman problem
Hsieh, Kuang-Han
[J]. JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2011, 28 (03) : 237 - 246
[6] Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
Kuennemann, Marvin
Manthey, Bodo
[J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 859 - 871
[7] Hardware implementation of 2-opt local search algorithm for the traveling salesman problem
Mavroidis, Ioannis
Papaefstathiou, Loannis
Pnevmatikatos, Dionisios
[J]. RSP 2007: 18TH IEEE/IFIP INTERNATIONAL WORKSHOP ON RAPID SYSTEM PROTOTYPING, PROCEEDINGS, 2007, : 41 - +
[8] Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
Martinovic, Goran
Bajer, Drazen
[J]. ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING, 2012, 12 (01) : 25 - 32
[9] The approximation ratio of the greedy algorithm for the metric traveling salesman problem
Brecklinghaus, Judith
Hougardy, Stefan
[J]. OPERATIONS RESEARCH LETTERS, 2015, 43 (03) : 259 - 261
[10] Ant Supervised by PSO and 2-Opt algorithm, AS-PSO-2Opt, Applied to Traveling Salesman Problem
Kefi, Sonia
Rokbani, Nizar
Kromer, Pavel
Alimi, Adel M.
[J]. 2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 4866 - 4871

← 1 2 3 4 5 →