Vehicle Routing Problem with Delivery Options and Roaming Delivery Locations

Authors

  • Narges Delavar Pasikhani * Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran.
  • Mohammad Reza Akbari Jokar Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran.

https://doi.org/10.48313/scodm.v3i2.55

Abstract

This study examines a variation of the Vehicle Routing Problem (VRP) that incorporates roaming delivery locations and flexible delivery options. In this model, each customer may be served at one of several potential locations, including Shared Delivery Centers (SDC) that provide centralized access to packages. To simultaneously optimize route planning, delivery location selection, and service timing while accounting for shared center limitations, vehicle capacity, and time windows, a mixed-integer linear programming formulation is proposed. The model is evaluated against a baseline scenario in which each customer has a single fixed delivery point. Computational results from a numerical example demonstrate that enabling roaming and flexible delivery can significantly improve efficiency by reducing vehicle usage, maintaining full customer coverage without increasing waiting times, and cutting total costs by more than 40%. These findings highlight practical strategies for optimizing urban distribution and emphasize the operational advantages of offering delivery choices in last-mile logistics.

Keywords:

Urban last mile logistics, Vehicle routing problem, Roaming delivery locations, Vehicle routing problem with delivery options, Attended home delivery, Shared delivery locations

References

  1. [1] Boysen, N., Fedtke, S., & Schwerdfeger, S. (2020). Last-mile delivery concepts: A survey from an operational research perspective. OR spectrum, 43(1), 1–58. https://doi.org/10.1007/s00291-020-00607-8
  2. [2] Elshaer, R., & Awad, H. (2020). A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers & industrial engineering, 140, 106242. https://doi.org/10.1016/j.cie.2019.106242
  3. [3] Toth, P., & Vigo, D. (2002). The vehicle routing problem. Society for industrial and applied mathematics. https://doi.org/10.1137/1.9780898718515.fm
  4. [4] Reyes, D., Savelsbergh, M., & Toriello, A. (2017). Vehicle routing with roaming delivery locations. Transportation research part C: Emerging technologies, 80, 71–91. https://doi.org/10.1016/j.trc.2017.04.003
  5. [5] Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80–91. https://doi.org/10.1287/mnsc.6.1.80
  6. [6] Konstantakopoulos, G. D., Gayialis, S. P., & Kechagias, E. P. (2022). Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Operational research, 22(3), 2033–2062. https://doi.org/10.1007/s12351-020-00600-7
  7. [7] Montoya-Torres, J. R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & industrial engineering, 79, 115–129. https://doi.org/10.1016/j.cie.2014.10.029
  8. [8] Bräysy, O., Dullaert, W., & Gendreau, M. (2004). Evolutionary algorithms for the vehicle routing problem with time windows. Journal of heuristics, 10(6), 587–611. https://doi.org/10.1007/s10732-005-5431-6
  9. [9] Dumez, D., Lehuédé, F., & Péton, O. (2021). A large neighborhood search approach to the vehicle routing problem with delivery options. Transportation research part B: methodological, 144, 103–132. https://doi.org/10.1016/j.trb.2020.11.012
  10. [10] Lombard, A., Tamayo-Giraldo, S., & Fontane, F. (2018). Vehicle routing problem with roaming delivery locations and stochastic travel times (VRPRDL-S). Transportation research procedia, 30, 167–177. https://doi.org/10.1016/j.trpro.2018.09.019
  11. [11] Ozbaygin, G., Ekin Karasan, O., Savelsbergh, M., & Yaman, H. (2017). A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Transportation research part B: Methodological, 100, 115–137. https://doi.org/10.1016/j.trb.2017.02.003
  12. [12] Sadati, M. E. H., Akbari, V., & Çatay, B. (2022). Electric vehicle routing problem with flexible deliveries. International journal of production research, 60(13), 4268–4294. https://doi.org/10.1080/00207543.2022.2032451
  13. [13] Grabenschweiger, J., Doerner, K. F., Hartl, R. F., & Savelsbergh, M. W. P. (2021). The vehicle routing problem with heterogeneous locker boxes. Central european journal of operations research, 29(1), 113–142. https://doi.org/10.1007/s10100-020-00725-2
  14. [14] Mancini, S., & Gansterer, M. (2021). Vehicle routing with private and shared delivery locations. Computers & operations research, 133, 105361. https://doi.org/10.1016/j.cor.2021.105361
  15. [15] Lemke, J., Iwan, S., & Korczak, J. (2016). Usability of the parcel lockers from the customer perspective – the research in polish cities. Transportation research procedia, 16, 272–287. https://doi.org/10.1016/j.trpro.2016.11.027
  16. [16] Tilk, C., Olkis, K., & Irnich, S. (2021). The last-mile vehicle routing problem with delivery options. OR spectrum, 43(4), 877–904. https://doi.org/10.1007/s00291-021-00633-0

Downloads

Published

2026-05-20

Issue

Vol. 3 No. 2 (2026): Supply Chain and Operations Decision Making

Section

Articles

How to Cite

Delavar Pasikhani, N. ., & Akbari Jokar, M. R. . (2026). Vehicle Routing Problem with Delivery Options and Roaming Delivery Locations. Supply Chain and Operations Decision Making, 3(2), 87-96. https://doi.org/10.48313/scodm.v3i2.55

Similar Articles

1-10 of 27

You may also start an advanced similarity search for this article.