@inproceedings{d530dddbe8184089a17830949839ab8a,
title = "Dynamic assignment vehicle routing problem with time windows",
abstract = "Offering time windows to receivers of last-mile delivery is becoming a distinguishing factor. However, we see that in practice carriers have to create routes for their vehicles based on destination information, that is just being revealed when a parcel arrives in the depot. The parcel has to be assigned directly to a vehicle, making this a Dynamic Assignment Vehicle Routing Problem. Incorporating time windows is hard in this case. In this paper an approach is presented to solve this problem including Time Windows. A comparison is made with a real observation and with a solution method for the base problem",
keywords = "Dynamic Vehicle Routing, Home delivery, Time Windows",
author = "Los, {Kim J} and F Phillipson and {van Kempen}, {Elisah A.} and Hans Quak and Uilke Stelwagen",
year = "2020",
doi = "10.1007/978-3-030-59747-4_9",
language = "English",
isbn = "9783030597467",
volume = "12433",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Cham",
pages = "135--150",
editor = "{Lalla-Ruiz }, E and M Mes and {Vo{\ss} }, S",
booktitle = "Computational Logistics - 11th International Conference, ICCL 2020, Proceedings",
}