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 条
  • [31] A Carnivorous Plant Algorithm With Heuristic Decoding Method for Traveling Salesman Problem
    Wang, Jiquan
    Zhang, Panli
    Zhang, Hongyu
    Song, Haohao
    Bei, Jinling
    Sun, Wenfeng
    Sun, Xiaobo
    IEEE ACCESS, 2022, 10 : 97142 - 97164
  • [32] A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem
    Zhang, Panli
    Wang, Jiquan
    Tian, Zhanwei
    Sun, Shengzhi
    Li, Jianting
    Yang, Jingnan
    APPLIED SOFT COMPUTING, 2022, 127
  • [33] A Linear Time Algorithm for Optimal Bottleneck Traveling Salesman Problem on a Halin Graph
    Lou, Dingjun
    Dou, Hongke
    2011 INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION AND INFORMATION TECHNOLOGY (ICCCIT 2011), 2011, : 60 - 62
  • [34] A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem
    Dong, Xueshi
    Lin, Qing
    Shen, Fanfan
    Guo, Qingteng
    Li, Qingshun
    SWARM AND EVOLUTIONARY COMPUTATION, 2023, 83
  • [35] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    SWEENEY, DW
    KAREL, C
    OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989
  • [36] A NEW HEURISTIC FOR THE PERIOD TRAVELING SALESMAN PROBLEM
    CHAO, IM
    GOLDEN, BL
    WASIL, EA
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (05) : 553 - 565
  • [37] A heuristic for the pickup and delivery traveling salesman problem
    Renaud, J
    Boctor, FF
    Ouenniche, J
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (09) : 905 - 916
  • [38] Heuristic approaches for the family traveling salesman problem
    Bernardino, Raquel
    Paias, Ana
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2021, 28 (01) : 262 - 295
  • [39] A MULTIPERIOD TRAVELING SALESMAN PROBLEM - HEURISTIC ALGORITHMS
    PALETTA, G
    COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (08) : 789 - 795
  • [40] Experimental analysis of heuristics for the bottleneck traveling salesman problem
    LaRusic, John
    Punnen, Abraham P.
    Aubanel, Eric
    JOURNAL OF HEURISTICS, 2012, 18 (03) : 473 - 503
12345