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 条

[1] The matching augmentation problem: a 7/4-approximation algorithm
Cheriyan, J.
Dippel, J.
Grandoni, F.
Khan, A.
Narayan, V. V.
MATHEMATICAL PROGRAMMING, 2020, 182 (1-2) : 315 - 354
[2] A DYNAMIC-PROGRAMMING ALGORITHM FOR THE TRAVELING REPAIRMAN PROBLEM
YANG, CE
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1989, 6 (02) : 192 - 206
[3] Memetic algorithm for the multiple traveling repairman problem with profits
Lu, Yongliang
Benlic, Una
Wu, Qinghua
Peng, Bo
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 80 : 35 - 47
[4] SIMULATION OF A TRAVELING REPAIRMAN PROBLEM
GREEN, CJ
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (04): : 409 - &
[5] Approximation algorithms for the a priori traveling repairman
Navidi, Fatemeh
Li Gortz, Inge
Nagarajan, Viswanath
OPERATIONS RESEARCH LETTERS, 2020, 48 (05) : 599 - 606
[6] THE COMPLEXITY OF THE TRAVELING REPAIRMAN PROBLEM
AFRATI, F
COSMADAKIS, S
PAPADIMITRIOU, CH
PAPAGEORGIOU, G
PAPAKOSTANTINOU, N
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1986, 20 (01): : 79 - 87
[7] The A Priori Traveling Repairman Problem
van Ee, Martijn
Sitters, Rene
ALGORITHMICA, 2018, 80 (10) : 2818 - 2833
[8] A note on the traveling repairman problem
García, A
Jodrá, P
Tejel, J
NETWORKS, 2002, 40 (01) : 27 - 31
[9] The A Priori Traveling Repairman Problem
Martijn van Ee
René Sitters
Algorithmica, 2018, 80 : 2818 - 2833
[10] A 4-Approximation Algorithm for Min Max Correlation Clustering
Heidrich, Holger
Irmai, Jannik
Andres, Bjoern
INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 238, 2024, 238

← 1 2 3 4 5 →