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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Joerss, M., Neuhaus, F., Schröder, J.: How customer demands are reshaping lastmile delivery. Travel Transp. Logist. 1, 4 (2016)
Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)
Phillipson, F., De Koff, S., van Ommeren, C., Quak, H.: Dynamic assignment vehicle routing problem with generalised capacity and unknown workload. In: Proceedings of 9th International Conference on Operations Research and Enterprise Systems (ICORES) (2020)
Phillipson, F., de Koff, S.: Immediate parcel to vehicle assignment for cross docking in city logistics. In: Proceedings of 9th International Conference on Operations Research and Enterprise Systems (ICORES) (2020)
Baldacci, R., Toth, P., Vigo, D.: Recent advances in vehicle routing exact algorithms. 4OR 5(4), 269–298 (2007)
Rincon-Garcia, N., Waterson, B., Cherrett, T.J., Salazar-Arrieta, F.: A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations-an application in city logistics. Transp. Res. Part A Policy Pract. 137, 429–446 (2018)
Yao, Y., et al.: ADMM-based problem decomposition scheme for vehicle routing problem with time windows. Transp. Res. Part B Methodol. 129, 156–174 (2019)
Van Duin, J., De Goffau, W., Wiegmans, B., Tavasszy, L., Saes, M.: Improving home delivery efficiency by using principles of address intelligence for B2C deliveries. Transp. Res. Procedia 12, 14–25 (2016)
Shao, S., Xu, G., Li, M., Huang, G.Q.: Synchronizing e-commerce city logistics with sliding time windows. Transp. Res. Part E Logist. Transp. Rev. 123, 17–28 (2019)
Agatz, N., Campbell, A., Fleischmann, M., Savelsbergh, M.: Time slot management in attended home delivery. Transp. Sci. 45(3), 435–449 (2011)
Solomon, M.M., Desrosiers, J.: Survey paper–time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1–13 (1988)
Ghannadpour, S.F., Noori, S., Tavakkoli-Moghaddam, R., Ghoseiri, K.: A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl. Soft Comput. 14, 504–527 (2014)
Chen, S., Chen, R., Wang, G.G., Gao, J., Sangaiah, A.K.: An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Comput. Electr. Eng. 67, 596–607 (2018)
de Armas, J., Melián-Batista, B.: Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Comput. Indust. Eng. 85, 120–131 (2015)
Schyns, M.: An ant colony system for responsive dynamic vehicle routing. Eur. J. Oper. Res. 245(3), 704–718 (2015)
Spliet, R., Desaulniers, G.: The discrete time window assignment vehicle routing problem. Eur. J. Oper. Res. 244(2), 379–391 (2015)
Dalmeijer, K., Spliet, R.: A branch-and-cut algorithm for the time window assignment vehicle routing problem. Comput. Oper. Res. 89, 140–152 (2018)
Los, K.: Improving delivery efficiency using a dynamic assignment method. Master’s thesis, Erasmus University (2019)
James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning. STS, vol. 103. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-7138-7
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)
Quak, H., van Kempen, E., van Dijk, B., Phillipson, F.: Self-organization in parcel distribution-SOLiD’s first results. In: IPIC 2019 6th International Physical Internet Conference London (2019)
Acknowledgements
The authors like to thank the Dutch Topsector Logistics (TKI Dinalog and NWO) for the support to Project SOLiD (NWO project number 439.17.551). The aims of the SOLiD project [22] is to bridge the gap between the long(er) term vision and the short term daily logistics operations in self-organising parcel distribution.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Los, K.J., Phillipson, F., van Kempen, E.A., Quak, H.J., Stelwagen, U. (2020). Dynamic Assignment Vehicle Routing Problem with Time Windows. In: Lalla-Ruiz, E., Mes, M., Voß, S. (eds) Computational Logistics. ICCL 2020. Lecture Notes in Computer Science(), vol 12433. Springer, Cham. https://doi.org/10.1007/978-3-030-59747-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-59747-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59746-7
Online ISBN: 978-3-030-59747-4
eBook Packages: Computer ScienceComputer Science (R0)