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 条
  • [11] A 3/4-Approximation Algorithm for Multiple Subset Sum
    Alberto Caprara
    Hans Kellerer
    Ulrich Pferschy
    Journal of Heuristics, 2003, 9 : 99 - 111
  • [12] An effective hybrid search algorithm for the multiple traveling repairman problem with profits
    Ren, Jintong
    Hao, Jin-Kao
    Wu, Feng
    Fu, Zhang-Hua
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 304 (02) : 381 - 394
  • [13] Solving the traveling repairman problem on a line with general processing times and deadlines
    Bock, Stefan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) : 690 - 703
  • [14] A 3/4-approximation algorithm for multiple subset sum
    Caprara, A
    Kellerer, H
    Pferschy, U
    JOURNAL OF HEURISTICS, 2003, 9 (02) : 99 - 111
  • [15] The Machine Learning and Traveling Repairman Problem
    Tulabandhula, Theja
    Rudin, Cynthia
    Jaillet, Patrick
    ALGORITHMIC DECISION THEORY, 2011, 6992 : 262 - 276
  • [16] The k-traveling repairman problem
    Fakcharoenphol, J
    Harrelson, C
    Rao, S
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 655 - 664
  • [17] Online traveling repairman problem with Quotas
    Jian J.
    Zhang J.
    Wu T.
    He L.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (08): : 2871 - 2878
  • [18] A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
    Amano, Yuki
    Makino, Kazuhisa
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 237 - 248
  • [19] Heuristics for the traveling repairman problem with profits
    Dewilde, T.
    Cattrysse, D.
    Coene, S.
    Spieksma, F. C. R.
    Vansteenwegen, P.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (07) : 1700 - 1707
  • [20] NEW 3/4-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM
    GOEMANS, MX
    WILLIAMSON, DP
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 656 - 666
12345