Article ID Journal Published Year Pages File Type
1142971 Operations Research Letters 2009 4 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Vehicle routing problems on a line-shaped network with release time constraints
Authors
, ,