Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not account for driving hours regulations, which restrict the available travel time for truck drivers. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing of a VRPTW. We propose an ILP formulation that minimizes the total duty time. The results of a case study indicate that duty time reductions of 15% can be achieved. Furthermore, computational experiments on VRPTW benchmarks indicate that ignoring traffic congestion or driving hours regulations leads to practically infeasible solutions. Therefore, new vehicle routing methods should be developed that account for these common restrictions. We propose an integrated approach based on classical insertion heuristics. © 2010 Elsevier B.V. All rights reserved.
https://doi.org/10.1016/j.ejor.2010.10.017Cite as:
@article{Kok_2011,
doi = {10.1016/j.ejor.2010.10.017},
url = {https://doi.org/10.1016%2Fj.ejor.2010.10.017},
year = 2011,
month = {may},
publisher = {Elsevier {BV}},
volume = {210},
number = {3},
pages = {579--587},
author = {A.L. Kok and E.W. Hans and J.M.J. Schutten},
title = {Optimizing departure times in vehicle routes},
journal = {European Journal of Operational Research}
}