An efficient heuristic algorithm for the bottleneck traveling salesman problem

被引：6

作者：

Ramakrishnan R. ^{[1
]}

Sharma P. ^{[2
]}

Punnen A.P. ^{[3
]}

机构：

[1] Department of Applied Statistics, Lausanne, CH - 1015, MA B1 453, EPFL

[2] Department of Mathematics and Statistics, Indian Institute of Technology Kanpur

[3] Department of Mathematics, Simon Fraser University Surrey, Surrey, BC, V3T 0A3, Central City, 250-13450

来源：

OPSEARCH | 2009年 / 46卷 / 3期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Bottleneck problems; Combinatorial optimization; Experimental analysis; Traveling salesman problem;

D O I：

10.1007/s12597-009-0018-x

中图分类号：

学科分类号：

摘要：

This paper describes a new heuristic algorithm for the bottleneck traveling salesman problem (BTSP), which exploits the formulation of BTSP as a traveling salesman problem (TSP). Computational tests show that our algorithm is quite effective. It found optimal solutions for many problems from the standard traveling salesman problem library (TSPLIB) problems. We also consider BTSP with an additional constraint and show that our BTSP heuristic can be modified to obtain a heuristic to solve this problem. Relationships between symmetric and asymmetric versions of BTSP are also discussed. © Operational Research Society of India.

引用

页码：275 / 288

页数：13

共 50 条

[41] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
An, Hyung-Chan
Kleinberg, Robert D.
Shmoys, David B.
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 1 - +
[42] Experimental analysis of heuristics for the bottleneck traveling salesman problem
John LaRusic
Abraham P. Punnen
Eric Aubanel
Journal of Heuristics, 2012, 18 : 473 - 503
[43] BOTTLENECK TRAVELING SALESMAN PROBLEM - ALGORITHMS AND PROBABILISTIC ANALYSIS
GARFINKEL, RS
GILBERT, KC
JOURNAL OF THE ACM, 1978, 25 (03) : 435 - 448
[44] A faster heuristic for the traveling salesman problem with drone
Hokama, Pedro Henrique Del Bianco
Lintzmayer, Carla Negri
San Felice, Mario Cesar
OPTIMIZATION LETTERS, 2024,
[45] An improved heuristic for the period traveling salesman problem
Bertazzi, L
Paletta, G
Speranza, MG
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (08) : 1215 - 1222
[46] Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Weiler, Christoph
Biesinger, Benjamin
Hu, Bin
Raidl, Guenther R.
COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2015, 2015, 9520 : 342 - 349
[47] An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
Dimitrijevic, V
Saric, Z
INFORMATION SCIENCES, 1997, 102 (1-4) : 105 - 110
[48] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
An, Hyung-Chan
Kleinberg, Robert D.
Shmoys, David B.
ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (04)
[49] GUARANTEED PERFORMANCE HEURISTICS FOR THE BOTTLENECK TRAVELING SALESMAN PROBLEM
PARKER, RG
RARDIN, RL
OPERATIONS RESEARCH LETTERS, 1984, 2 (06) : 269 - 272
[50] Searching for backbones - An efficient parallel algorithm for the traveling salesman problem
Schneider, J
Froschhammer, C
Morgenstern, I
Husslein, T
Singer, JM
COMPUTER PHYSICS COMMUNICATIONS, 1996, 96 (2-3) : 173 - 188

← 1 2 3 4 5 →