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 条
  • [1] An Efficient Heuristic Algorithm for the Traveling Salesman Problem
    Azimi, Parham
    Daneshvar, Peyman
    ADVANCED MANUFACTURING AND SUSTAINABLE LOGISTICS, PROCEEDINGS, 2010, 46 : 384 - +
  • [2] AN ALGORITHM FOR THE BOTTLENECK TRAVELING SALESMAN PROBLEM
    CARPANETO, G
    MARTELLO, S
    TOTH, P
    OPERATIONS RESEARCH, 1984, 32 (02) : 380 - 389
  • [3] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 223 - 235
  • [4] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 315 - 326
  • [5] HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
    RAYMOND, TC
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1969, 13 (04) : 400 - &
  • [6] A Quantum Heuristic Algorithm for the Traveling Salesman Problem
    Bang, Jeongho
    Ryu, Junghee
    Lee, Changhyoup
    Yoo, Seokwon
    Lim, James
    Lee, Jinhyoung
    JOURNAL OF THE KOREAN PHYSICAL SOCIETY, 2012, 61 (12) : 1944 - 1949
  • [7] A quantum heuristic algorithm for the traveling salesman problem
    Jeongho Bang
    Junghee Ryu
    Changhyoup Lee
    Seokwon Yoo
    James Lim
    Jinhyoung Lee
    Journal of the Korean Physical Society, 2012, 61 : 1944 - 1949
  • [8] New heuristic algorithm for traveling salesman problem
    Shahab, M. L.
    INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2019, 1218
  • [9] Exact Heuristic Algorithm for Traveling Salesman Problem
    Lin, Dongmei
    Wu, Xiangbin
    Wang, Dong
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 9 - +
  • [10] A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem
    Ahmed, Zakir Hussain
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2013, 12 (01)
12345