Approximation algorithms for the traveling repairman and speeding deliveryman problems with unit-time windows

被引：0
|
作者：
Frederickson, Greg N. [1 ]
Wittman, Barry [1 ]
机构：
[1] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA
来源：
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES | 2007年 / 4627卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Constant-factor, polynomial-time approximation algorithms are presented for two variations of the traveling salesman problem with time windows. In the first variation, the traveling repairman problem, the goal is to find a tour that visits the maximum possible number of locations during their time windows. In the second variation, the speeding deliveryman problem, the goal is to find a tour that uses the minimum possible speed to visit all locations during their time windows. For both variations, the time windows are of unit length, and the distance metric is based on a weighted, undirected graph. Algorithms with improved approximation ratios are given for the case when the input is defined on a tree rather than a general graph. A sketch of NP-hardness is also given for the tree metric.
引用
收藏
页码：119 / +
页数：3
相关论文
共 50 条
  • [21] An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows
    Rifki, Omar
    Garaix, Thierry
    Solnon, Christine
    2021 IEEE 17TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2021, : 983 - 988
  • [22] Linear-Time Approximation Algorithms for Unit Disk Graphs
    da Fonseca, Guilherme D.
    Pereira de Sa, Vinicius G.
    de Figueiredo, Celina M. H.
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 132 - 143
  • [23] Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
    Xinzhen Zhang
    Guanglu Zhou
    Louis Caccetta
    Mohammed Alqahtani
    Frontiers of Mathematics in China, 2017, 12 : 1409 - 1426
  • [24] Solving Traveling Salesman Problems with Time Windows by Genetic Particle Swarm Optimization
    Wang Cheng
    Zeng Maimai
    Li Jian
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1752 - 1755
  • [25] Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
    Zhang, Xinzhen
    Zhou, Guanglu
    Caccetta, Louis
    Alqahtani, Mohammed
    FRONTIERS OF MATHEMATICS IN CHINA, 2017, 12 (06) : 1409 - 1426
  • [26] Unit-time scheduling problems with time dependent resourcesEinheits-Zeit Reihenfolge Probleme mit zeitabhängigen Ressourcen
    T. Tautenhahn
    G. J. Woeginger
    Computing, 1997, 58 (2) : 97 - 111
  • [27] Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
    Fachini, Ramon Faganello
    Armentano, Vinicius Amaral
    OPTIMIZATION LETTERS, 2020, 14 (03) : 579 - 609
  • [28] Approximation algorithms for the min-max clustered k-traveling salesmen problems
    Bao, Xiaoguang
    Xu, Lei
    Yu, Wei
    Song, Wei
    THEORETICAL COMPUTER SCIENCE, 2022, 933 : 60 - 66
  • [29] Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
    Ramon Faganello Fachini
    Vinícius Amaral Armentano
    Optimization Letters, 2020, 14 : 579 - 609
  • [30] Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
    Hougardy, Stefan
    RESEARCH TRENDS IN COMBINATORIAL OPTIMIZATION, 2009, : 185 - 200
12345