In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. In addition to vehicles routes, departure times are treated as decision variables, with delayed departure permitted at each node serviced. A heuristic comprising route construction and route improvement is proposed within which critical nodes are defined to delineate the scope of the remaining problem along the time rolling horizon and an efficient technique for choosing optimal departure times is developed. Fifty-six numerical problems and a real application are provided for demonstration. © 2005 Elsevier Ltd. All rights reserved.
https://doi.org/10.1016/j.tre.2005.01.003Cite as:
@article{Chen_2006,
doi = {10.1016/j.tre.2005.01.003},
url = {https://doi.org/10.1016%2Fj.tre.2005.01.003},
year = 2006,
month = {sep},
publisher = {Elsevier {BV}},
volume = {42},
number = {5},
pages = {383--408},
author = {Huey-Kuo Chen and Che-Fu Hsueh and Mei-Shiang Chang},
title = {The real-time time-dependent vehicle routing problem},
journal = {Transportation Research Part E: Logistics and Transportation Review}
}