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 条
  • [11] An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem
    Yousefikhoshbakht, Majid
    Dolatnejad, Azam
    BRAIN-BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE, 2016, 7 (03): : 125 - 138
  • [12] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
    LIN, S
    KERNIGHAN, BW
    OPERATIONS RESEARCH, 1973, 21 (02) : 498 - 516
  • [13] A HEURISTIC ALGORITHM FOR THE TRAVELING SALESMAN LOCATION PROBLEM ON NETWORKS
    SIMCHILEVI, D
    BERMAN, O
    OPERATIONS RESEARCH, 1988, 36 (03) : 478 - 484
  • [14] A Hybrid Heuristic Algorithm for the Euclidean Traveling Salesman Problem
    Singh, Dharm Raj
    Singh, Manoj Kumar
    Singh, Tarkeshwar
    2015 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION & AUTOMATION (ICCCA), 2015, : 773 - 778
  • [15] The period traveling salesman problem: a new heuristic algorithm
    Paletta, G
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (10) : 1343 - 1352
  • [16] An efficient heuristic for the traveling salesman problem based on a growing SOM-like algorithm
    Garcia, C
    Moreno, JA
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, 2005, : 177 - 180
  • [17] An Efficient Genetic Algorithm for the Traveling Salesman Problem
    Sun, Guangfu
    Li, Chengjun
    Zhu, Jiacheng
    Li, Yanpeng
    Liu, Wei
    COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, 2010, 107 : 108 - 116
  • [18] An Efficient and Scalable Algorithm for the Traveling Salesman Problem
    Ye, Chen
    Yang, Zhongcheng
    Yan, Tianxing
    2014 5TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS), 2014, : 335 - 339
  • [19] RAPID HEURISTIC ALGORITHM FOR APPROXIMATE SOLUTION OF TRAVELING SALESMAN PROBLEM
    WIORKOWSKI, JJ
    MCELVAIN, K
    TRANSPORTATION RESEARCH, 1975, 9 (2-3): : 181 - 185
  • [20] Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
    Gamboa, D
    Rego, C
    Glover, F
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) : 1154 - 1172
12345