Vehicle routing problems on a line-shaped network with release time constraints

DOI10.1016/j.orl.2008.10.006zbMath1159.90411MaRDI QIDQ1015302

Zhaohui Liu, Wei Yu

Publication date: 7 May 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.10.006

zbMATH Keywords

vehicle routing; vehicle scheduling; line-shaped network

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B20: Traffic problems in operations research

Related Items

Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle, Emergency path restoration problems

Uses Software

• DARCLASS

Cites Work

• Unnamed Item
• A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
• Routing and Scheduling on a Shoreline with Release Times
• The complexity of the travelling repairman problem
• Special cases of traveling salesman and repairman problems with time windows
• Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
• A note on the traveling repairman problem