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 条
  • [21] A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem
    Liu, S. B.
    Ng, K. M.
    Ong, H. L.
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 21, 2007, 21 : 267 - 271
  • [22] New hybrid heuristic algorithm for the clustered traveling salesman problem
    Mestria, Mario
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 116 : 1 - 12
  • [23] An efficient composite heuristic for the symmetric generalized traveling salesman problem
    Renaud, J
    Boctor, FF
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (03) : 571 - 584
  • [24] A multiple heuristic search algorithm for solving traveling salesman problem
    Gang, P
    Iimura, I
    Nakayama, S
    PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 779 - 783
  • [25] A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
    Phillips, JM
    Punnen, AP
    Kabadi, SN
    INFORMATION PROCESSING LETTERS, 1998, 67 (02) : 105 - 110
  • [26] A NEW HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM
    CARLIER, J
    VILLON, P
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (03): : 245 - 253
  • [27] HEURISTIC FOR ASYMMETRIC TRAVELING SALESMAN PROBLEM
    VANDERCRYUSSEN, P
    RIJCKAERT, MJ
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1978, 29 (07) : 697 - 701
  • [28] A hybrid heuristic for the traveling salesman problem
    Baraglia, R
    Hidalgo, JI
    Perego, R
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2001, 5 (06) : 613 - 622
  • [29] An efficient hybrid genetic algorithm for the traveling salesman problem
    Katayama, K
    Narihisa, H
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2001, 84 (02): : 76 - 83
  • [30] An efficient approach of the SOM algorithm to the traveling salesman problem
    Vieira, FC
    Neto, ADD
    Costa, JA
    VII BRAZILIAN SYMPOSIUM ON NEURAL NETWORKS, PROCEEDINGS, 2002, : 152 - 152
12345