Approximation algorithm for the Traveling Salesman Problem with Backhauls

被引：0
|
作者：
Universite de Montreal, Montreal, Canada [1 ]
机构：
来源：
Oper Res | / 4卷 / 639-641期
关键词：
Graph theory - Heuristic methods - Job analysis - Scheduling - Transportation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G = (V, E). The vertex set is partitioned into V = ({v1},L,B), where v1 is a depot, L is a set of linehaul customers, and B is a set of backhaul customers. A cost matrix satisfying the triangle inequality is defined on the edge set E. The TSPB consists of determining a least-cost Hamiltonian cycle on G such that all vertices of L are visited contiguously after v1, followed by all vertices of B. Following a result by Christofides for the Traveling Salesman Problem, we propose an approximation algorithm with worst-case performance ratio of 3/2 for the TSPB.
引用
收藏
相关论文
共 50 条
  • [41] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
    Yadlapalli, Sai
    Rathinam, Sivakumar
    Darbha, Swaroop
    OPTIMIZATION LETTERS, 2012, 6 (01) : 141 - 152
  • [42] 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 - +
  • [43] Approximation algorithms for the traveling salesman problem with range condition
    Kumar, DA
    Rangan, CP
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03): : 173 - 181
  • [44] A note on approximation algorithms of the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    Yu, Wei
    Li, Ganggang
    INFORMATION PROCESSING LETTERS, 2017, 127 : 54 - 57
  • [45] A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
    Bae, Jungyun
    Rathinam, Sivakumar
    OPTIMIZATION LETTERS, 2016, 10 (06) : 1269 - 1285
  • [46] Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
    Paluch, Katarzyna
    Elbassioni, Khaled
    van Zuylen, Anke
    29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 501 - 506
  • [47] Approximation of the Double Traveling Salesman Problem with Multiple Stacks
    Alfandari, Laurent
    Toulouse, Sophie
    THEORETICAL COMPUTER SCIENCE, 2021, 877 : 74 - 89
  • [48] A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
    Xu, Zhou
    Rodrigues, Brian
    ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 127 - +
  • [49] A heuristic for the traveling salesman problem based on a continuous approximation
    del Castillo, JM
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1999, 33 (02) : 123 - 152
  • [50] A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
    van Bevern, Rene
    Slugina, Viktoriia A.
    HISTORIA MATHEMATICA, 2020, 53 : 118 - 127
12345