| Article ID: | iaor20102932 |
| Volume: | 37 |
| Issue: | 2 |
| Start Page Number: | 85 |
| End Page Number: | 88 |
| Publication Date: | Mar 2009 |
| Journal: | Operations Research Letters |
| Authors: | Liu Zhaohui, Yu Wei |
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.