Time-dependent routing amounts to design “best” routes in a graph in which arc traversal times may vary over the planning horizon. In the last decade, a number of technological advances have stimulated an increased interest in this field. We survey the research in the area and present a comprehensive review of travel time modelling, applications and solution methods. In particular, we make a first classification in point-to-point and multiple-point problems. A second major classification is then performed with respect to the quality and evolution of information. Other criteria included: (i) node, arc or general routing; (ii) the possibility to choose the vehicle speed.
https://doi.org/10.1016/j.cor.2015.06.001Cite as:
@article{Gendreau_2015,
doi = {10.1016/j.cor.2015.06.001},
url = {https://doi.org/10.1016%2Fj.cor.2015.06.001},
year = 2015,
month = {dec},
publisher = {Elsevier {BV}},
volume = {64},
pages = {189--197},
author = {Michel Gendreau and Gianpaolo Ghiani and Emanuela Guerriero},
title = {Time-dependent routing problems: A review},
journal = {Computers {&}amp$mathsemicolon$ Operations Research}
}