A Fast 4-Approximation Algorithm for the Traveling Repairman Problem on a Line

被引：0
|
作者：
Perez Perez, S. L. [1 ,3 ]
Urban Riverol, L. E. [1 ]
Lopez Bracho, R. [2 ]
Zaragoza Martinez, F. J. [2 ]
机构：
[1] UAM Azcapotzalco, Posgrad Optimizac, Mexico City, DF, Mexico
[2] UAM Azcapotzalco, Dept Sistemas, Mexico City, DF, Mexico
[3] UAM Cuajimalpa, Dept Tecnol Informac, Mexico City, DF, Mexico
来源：
2014 11TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE) | 2014年
关键词：
Traveling repairman problem; scheduling problem; unit time windows; approximation algorithm; SPEEDING DELIVERYMAN PROBLEMS; TIME WINDOWS; APPROXIMATION ALGORITHMS; SALESMAN;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The traveling repairman problem is a scheduling problem in which a repairman is supposed to visit some customers at their locations to perform some jobs. Each customer has a time window during which the repairman is allowed to arrive to perform the jobs. The goal is to maximize the number of visited locations. In this work we deal with a special case in which the locations are on a line, the processing time of each job is zero, and the time window length is unitary. Although the general TRP is NP-Hard, the complexity of this special case remains unknown. We introduce a quadratic 4-approximation algorithm based on the 8-approximation algorithm proposed in 2005 by R. Bar-Yehuda, G. Even, and S. Shahar.
引用
收藏
页数：4
相关论文
共 50 条
  • [41] An Improved Approximation Algorithm for the Traveling Tournament Problem
    Yamaguchi, Daisuke
    Imahori, Shinji
    Miyashiro, Ryuhei
    Matsui, Tomomi
    ALGORITHMICA, 2011, 61 (04) : 1077 - 1091
  • [42] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 315 - 326
  • [43] An Approximation Algorithm for the Bipartite Traveling Tournament Problem
    Hoshino, Richard
    Kawarabayashi, Ken-ichi
    MATHEMATICS OF OPERATIONS RESEARCH, 2013, 38 (04) : 720 - 728
  • [44] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 223 - 235
  • [45] An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
    Jiang, Haitao
    Feng, Haodi
    Zhu, Daming
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 491 - 503
  • [46] A 3/4-approximation algorithm for maximum ATSP with weights zero and one
    Bläser, M
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 61 - 71
  • [47] A MEAN-VALUE ANALYSIS OF THE TRAVELING REPAIRMAN PROBLEM
    AGNIHOTHRI, SR
    IIE TRANSACTIONS, 1988, 20 (02) : 223 - 229
  • [48] New formulations for the traveling repairman problem with time windows
    Uzun, Gozde Onder
    Kara, Imdat
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 176 (176)
  • [49] Approximating the k-traveling repairman problem with repairtimes
    Jothi, Raja
    Raghavachari, Balaji
    JOURNAL OF DISCRETE ALGORITHMS, 2007, 5 (02) : 293 - 303
  • [50] The risk-averse traveling repairman problem with profits
    P. Beraldi
    M. E. Bruni
    D. Laganà
    R. Musmanno
    Soft Computing, 2019, 23 : 2979 - 2993
12345