The field of dynamic vehicle routing and scheduling is growing at a fast pace nowadays, due to many potential applications in courier services, emergency services, truckload and less-than-truckload trucking, and many others. In this paper, a dynamic vehicle routing and scheduling problem with time windows is described where both real-time customer requests and dynamic travel times are considered. Different reactive dispatching strategies are defined and compared through the setting of a single “tolerance” parameter. The results show that some tolerance to deviations with the current planned solution usually leads to better solutions. © 2004 Elsevier Ltd. All rights reserved.
https://doi.org/10.1016/j.cor.2004.09.015Cite as:
@article{Potvin_2006,
doi = {10.1016/j.cor.2004.09.015},
url = {https://doi.org/10.1016%2Fj.cor.2004.09.015},
year = 2006,
month = {apr},
publisher = {Elsevier {BV}},
volume = {33},
number = {4},
pages = {1129--1137},
author = {Jean-Yves Potvin and Ying Xu and Ilham Benyahia},
title = {Vehicle routing and scheduling with dynamic travel times},
journal = {Computers {&}amp$mathsemicolon$ Operations Research}
}
