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

Authors:
Wei Yu;Zhaohui Liu
Affiliations:
Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China;Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China
Venue:
Operations Research Letters
Year:
2009

Citing 5
Cited 1

Routing and scheduling on a shoreline with release times

Management Science
The Minimum Latency Problem Is NP-Hard for Weighted Trees

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times

Information Processing Letters
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

Discrete Applied Mathematics
Computer-Aided Complexity Classification of Dial-a-Ride Problems

INFORMS Journal on Computing

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

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work considers the vehicle routing problem on a line with the constraint that each customer is visited after its release time. It is already known that the single-vehicle case is polynomially solvable. We present polynomial time algorithms for two variants of the multi-vehicle case.