Abstract
This paper considers a vehicle routing problem where each vehicle performs delivery operations over multiple routes during its workday and where new customer requests occur dynamically. The proposed methodology for addressing the problem is based on an adaptive large neighborhood search heuristic, previously developed for the static version of the problem. In the dynamic case, multiple possible scenarios for the occurrence of future requests are considered to decide about the opportunity to include a new request into the current solution. It is worth noting that the real-time decision is about the acceptance of the new request, not about its service which can only take place in some future routes (a delivery route being closed as soon as a vehicle departs from the depot). In the computational results, a comparison is provided with a myopic approach which does not consider scenarios of future requests.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Azi, N., Gendreau, M., & Potvin, J.-Y. (2010a). An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research, 202, 756–763.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2010b). An adaptive large neighborhood search for a vehicle routing problem with multiple trips. Technical Report CIRRELT-2010-08, Montreal, submitted to Computers & Operations Research.
Bent, R., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52, 977–987.
Branke, J., Middendorf, M., Noeth, G., & Dessouky, M. (2005). Waiting strategies for dynamic vehicle routing. Transportation Science, 39, 298–312.
Campbell, A. M., & Savelsbergh, M. (2005). Decision support for consumer direct grocery initiatives. Transportation Science, 39, 313–327.
Fleischmann, B., Gnutzmann, S., & Sandvoss, E. (2004). Dynamic vehicle routing based on online traffic information. Transportation Science, 38, 420–433.
Giroudeau, R., Feillet, D., Hernandez, F., König, J.-C., & Naud, O. (2009). Multi-trip vehicle routing problem with time windows for agricultural tasks. In Fourth international workshop on freight transportation and logistics, Izmir, Turkey, 2009.
Gribkovskaia, I., Gullberg, B. O., Hovden, K. J., & Wallace, S. W. (2006). Optimization model for a livestock collection problem. International Journal of Physical Distribution & Logistics Management, 36, 136–152.
Hvattum, L. M., Lokketangen, A., & Laporte, G. (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science, 40, 421–438.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2006). Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Science, 40, 211–225.
Lin, I. L., & Mahmassani, H. S. (2002). Can online grocers deliver? Some logistics considerations. Transportation Research Record, 1817, 17–24.
Mitrović, M., & Laporte, G. (2004). Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 38, 635–655.
Mitrović, M., Krishnamurti, R., & Laporte, G. (2004). Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 38, 669–685.
Potvin, J.-Y., Ying, X., & Benyahia, I. (2006). Vehicle routing and scheduling with dynamic travel times. Computers & Operations Research, 33, 1129–1137.
Punakivi, M., & Saranen, J. (2001). Identifying the success factors in e-grocery home delivery. International Journal of Retail and Distribution Management, 29, 156–163.
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40, 455–472.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Azi, N., Gendreau, M. & Potvin, JY. A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199, 103–112 (2012). https://doi.org/10.1007/s10479-011-0991-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0991-3