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 条

[41] Approximation algorithms for bandwidth and Storage Allocation problems under real time constraints
Leonardi, S
Marchetti-Spaccamela, A
Vitaletti, A
FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 409 - 420
[42] Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem
Khachay, M. Yu.
Neznakhina, E. D.
Ryzhenko, K. V.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2022, 319 (SUPPL 1) : S140 - S155
[43] Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to Asymmetric Traveling Salesman Problem
Khachai, M. Yu
Neznakhina, E. D.
Ryzhenko, K., V
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2022, 28 (03): : 241 - 258
[44] Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem
M. Yu. Khachay
E. D. Neznakhina
K. V. Ryzhenko
Proceedings of the Steklov Institute of Mathematics, 2022, 319 : S140 - S155
[45] Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms
Wang, Jiahai
Zhou, Ying
Wang, Yong
Zhang, Jun
Chen, C. L. Philip
Zheng, Zibin
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (03) : 582 - 594
[46] Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls
Cheung, RK
Hang, DD
IIE TRANSACTIONS, 2003, 35 (03) : 191 - 205
[47] Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm
Ban, Ha-Bang
Pham, Dang-Hai
PEERJ COMPUTER SCIENCE, 2023, 9
[48] IMPROVED CONSTANT-TIME APPROXIMATION ALGORITHMS FOR MAXIMUM MATCHINGS AND OTHER OPTIMIZATION PROBLEMS
Yoshida, Yuichi
Yamamoto, Masaki
Ito, Hiro
SIAM JOURNAL ON COMPUTING, 2012, 41 (04) : 1074 - 1093
[49] Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
Xu, Zhou
Xu, Liang
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 383 - 392
[50] Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
Jiang, Xiaojuan
Lee, Kangbok
Pinedo, Michael L.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 305 (02) : 594 - 607

← 1 2 3 4 5 →