A Vehicle Routing Problem for Multi-depot Collaborative Delivery Considering Common and Neighboring Customers

  • Yanbing Gao Business School of Sichuan University, China
Keywords: mobile lockers, common customers, neighboring customers, collaborative delivery

Abstract

Facing the challenges of delivery cost, efficiency, and security in modern logistics systems, this study investigates a realistic scenario where multiple logistics companies jointly serve a common customer base, and customers' parcels can be picked up by their neighboring customers. By integrating mobile lockers and drones into the delivery process, we propose a multi-depot collaborative delivery vehicle routing problem with common and neighboring customers, and formulate a corresponding mixed-integer programming model. To solve the problem efficiently, a hybrid heuristic algorithm combining Adaptive Large Neighborhood Search and Tabu Search is developed. Numerical experiments demonstrate that collaboration among depots based on common and neighboring customers offers significant advantages: It not only reduces delivery costs but also improves the utilization efficiency of mobile lockers and reduces the required number of lockers. Moreover, the greater the number of depots participating in collaborative delivery, the more pronounced the benefits.

References

[1] Gu, R. X., Liu, Y., & Poon, M. (2023). Dynamic truck–drone routing problem for scheduled deliveries and on-demand pickups with time-related constraints. Transportation Research Part C: Emerging Technologies, 151, 104139. https://doi.org/10.1016/j.trc.2023.104139
[2] Dolan, S. (2018). The challenges of last mile delivery logistics & the technology solutions cutting costs. Business Insider, 10. DOI not available.
[3] Gaba, F., & Winkenbach, M. (2020). A systems-level technology policy analysis of the truck-and-drone cooperative delivery vehicle system. Retrieved from https://dspace.mit.edu/handle/1721.1/125416. DOI not available.
[4] Grabenschweiger, J., Doerner, K. F., & Hartl, R. F. (2022). The multi-period location routing problem with locker boxes. Logistics Research, 15(1). https://doi.org/10.23773/2022_1
[5] Schwerdfeger, S., & Boysen, N. (2020). Optimizing the changing locations of mobile lockers in last-mile distribution. European Journal of Operational Research, 285(3), 1077–1094. https://doi.org/10.1016/j.ejor.2020.03.001
[6] Li, J., Ensafian, H., Bell, M. G. H., & Zhang, W. (2021). Deploying autonomous mobile lockers in a two-echelon parcel operation. Transportation Research Part C: Emerging Technologies, 128, 103155. https://doi.org/10.1016/j.trc.2021.103155
[7] Schwerdfeger, S., & Boysen, N. (2022). Who moves the locker? A benchmark study of alternative mobile locker concepts. Transportation Research Part C: Emerging Technologies, 142, 103780. https://doi.org/10.1016/j.trc.2022.103780
[8] Lan, Y. L., Liu, F., Ng, W. W. Y., & Zhang, A. (2022). Multi-objective two-echelon city dispatching problem with mobile satellites and crowd-shipping. IEEE Transactions on Intelligent Transportation Systems, 23(9), 15340–15353. https://doi.org/10.1109/TITS.2021.3126452
[9] Kötschau, R., Soeffker, N., & Ehmke, J. F. (2023). Mobile lockers with individual customer service. Networks, 82(4), 506–526. https://doi.org/10.1002/net.22153
[10] Wang, Y., Bi, M. Y., Lai, J. H., & Zhang, D. (2024). Recourse strategy for the routing problem of mobile lockers with time windows under uncertain demands. European Journal of Operational Research, 316(3), 942–957. https://doi.org/10.1016/j.ejor.2023.11.037
[11] Korkmaz, S. G., Soysal, M., Sel, Ç., & Kara, B. Y. (2025). Modeling a location and routing problem for mobile lockers in last-mile delivery with horizontal collaboration. Networks, 0, 1–27. https://doi.org/10.1002/net.22230
[12] Murray, C. C., & Chu, A. G. (2015). The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Research Part C: Emerging Technologies, 54, 86–109. https://doi.org/10.1016/j.trc.2015.03.005
[13] Chung, S. H., Sah, B., & Lee, J. K. (2020). Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions. Computers & Operations Research, 123, 105004. https://doi.org/10.1016/j.cor.2020.105004
[14] Manshadian, H., Amalnick, M. S., & Torabi, S. A. (2023). Synchronized truck and drone routing under disastrous conditions (case study: urban thoroughfares disinfection). Computers & Operations Research, 106295. https://doi.org/10.1016/j.cor.2023.106295
[15] Najy, W., Archetti, C., & Diabat, A. (2023). Collaborative truck-and-drone delivery for inventory-routing problems. Transportation Research Part C: Emerging Technologies, 146, 103791. https://doi.org/10.1016/j.trc.2023.103791
[16] Rave, A., Fontaine, P., & Kuhn, H. (2023). Drone location and vehicle fleet planning with trucks and aerial drones. European Journal of Operational Research, 308(1), 113–130. https://doi.org/10.1016/j.ejor.2023.01.002
The example of MCDVRPCNC problem
Published
2025-04-13
Section
Articles