IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v187y2024ics1366554524001649.html
   My bibliography  Save this article

The multi-fleet delivery problem combined with trucks, tricycles, and drones for last-mile logistics efficiency requirements under multiple budget constraints

Author

Listed:
  • Chen, Enming
  • Zhou, Zhongbao
  • Li, Ruiyang
  • Chang, Zhongxiang
  • Shi, Jianmai

Abstract

In the increasingly competitive urban logistics delivery business field, enhancing last-mile logistics efficiency with constrained budgets is crucial for logistics companies. With the increasing adoption of emerging vehicles in last-mile logistics, neglecting the capacity of traditional vehicles may be uneconomical. This paper introduces the multi-fleet delivery problem combined with Trucks, Tricycles, and Drones (MFDP-TTD) for last-mile logistics efficiency requirements under multiple budget constraints, which represents a novel variant of the Two-Echelon Vehicle Routing Problem. Compared to the truck-drone mode, truck-tricycle mode, and the Two-Echelon Vehicle Routing Problem, by adding the collaboration of an emerging delivery vehicle (drones) and a traditional delivery vehicle (tricycle), the MFDP-TTD improves the speed of delivery of last-mile logistics more cost-efficiently. To tackle this intricate issue, this paper devises a Mixed Integer Linear Programming (MILP) model, taking into account fixed cost-related budgets and operating cost-related budgets. The model allows for the integration of diverse numbers of tricycles and drones across various fleets, with larger vehicles accommodating smaller ones to moving. In addition, some valid inequalities based on the properties of the problem are presented to accelerate the solution process. To solve this problem efficiently on a large scale, the paper proposes a multi-start improved adaptive large neighborhood search algorithm (MS-IALNS) that combines the advantages of an adaptive large neighborhood search algorithm and an ant colony algorithm. In addition, four fast feasibility-checking strategies designed based on valid inequalities are proposed. Extensive computational experiments demonstrate the validity of the MILP model and valid inequalities and the advantages of the MS-IALNS. Compared to the multi-fleet delivery problem with Trucks and Tricycles, the Two-Echelon Vehicle Routing Problem, the two-echelon city delivery mode with mobile satellites, and other potential multi-fleet collaborative delivery modes, the MFDP-TTD exhibits clear advantages in integrated time costs under same multiple budget constraints. In addition, a balanced mix of numbers of tricycles and drones within the fleet, an appropriate increase in the fixed cost-related budgets, and retrofitting of trucks and tricycles to accommodate smaller vehicles and to carry batteries for replacement are recommended.

Suggested Citation

  • Chen, Enming & Zhou, Zhongbao & Li, Ruiyang & Chang, Zhongxiang & Shi, Jianmai, 2024. "The multi-fleet delivery problem combined with trucks, tricycles, and drones for last-mile logistics efficiency requirements under multiple budget constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    • Handle: RePEc:eee:transe:v:187:y:2024:i:c:s1366554524001649
    DOI: 10.1016/j.tre.2024.103573
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524001649
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103573?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Grangier, Philippe & Gendreau, Michel & Lehuédé, Fabien & Rousseau, Louis-Martin, 2016. "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization," European Journal of Operational Research, Elsevier, vol. 254(1), pages 80-91.
    2. Moshref-Javadi, Mohammad & Lee, Seokcheon & Winkenbach, Matthias, 2020. "Design and evaluation of a multi-trip delivery model with truck and drones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    3. Li, Hongqi & Chen, Jun & Wang, Feilong & Bai, Ming, 2021. "Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: A review," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1078-1095.
    4. Yücel, Eda & Salman, F. Sibel & Erdoğan, Güneş, 2022. "Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics," European Journal of Operational Research, Elsevier, vol. 302(3), pages 954-969.
    5. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    6. dos Santos, André Gustavo & Viana, Ana & Pedroso, João Pedro, 2022. "2-echelon lastmile delivery with lockers and occasional couriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    7. Meng, Shanshan & Chen, Yanru & Li, Dong, 2024. "The multi-visit drone-assisted pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 314(2), pages 685-702.
    8. Dell’Amico, Mauro & Montemanni, Roberto & Novellani, Stefano, 2021. "Algorithms based on branch and bound for the flying sidekick traveling salesman problem," Omega, Elsevier, vol. 104(C).
    9. Rave, Alexander & Fontaine, Pirmin & Kuhn, Heinrich, 2023. "Drone location and vehicle fleet planning with trucks and aerial drones," European Journal of Operational Research, Elsevier, vol. 308(1), pages 113-130.
    10. Wang, Yuan & Zhang, Dongxiang & Liu, Qing & Shen, Fumin & Lee, Loo Hay, 2016. "Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 279-293.
    11. Liu, Yubin & Ye, Qiming & Escribano-Macias, Jose & Feng, Yuxiang & Candela, Eduardo & Angeloudis, Panagiotis, 2023. "Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    12. Nguyen, Minh Anh & Dang, Giang Thi-Huong & Hà, Minh Hoàng & Pham, Minh-Trien, 2022. "The min-cost parallel drone scheduling vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 299(3), pages 910-930.
    13. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    14. Lipowski, Adam & Lipowska, Dorota, 2012. "Roulette-wheel selection via stochastic acceptance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(6), pages 2193-2196.
    15. Marta Jakowczyk & João Quariguasi Frota Neto & Andrew Gibson & Luk N. Van Wassenhove, 2017. "Understanding the market for remanufactured products: what can we learn from online trading and Web search sites?," International Journal of Production Research, Taylor & Francis Journals, vol. 55(12), pages 3465-3479, June.
    16. Zhen, Lu & Wu, Yiwei & Wang, Shuaian & Yi, Wen, 2021. "Crowdsourcing mode evaluation for parcel delivery service platforms," International Journal of Production Economics, Elsevier, vol. 235(C).
    17. Fan, Yu & Shao, Jianfang & Wang, Xihui, 2023. "Relief items procurement and delivery through cooperation with suppliers and logistics companies considering budget constraints," International Journal of Production Economics, Elsevier, vol. 264(C).
    18. Kitjacharoenchai, Patchara & Min, Byung-Cheol & Lee, Seokcheon, 2020. "Two echelon vehicle routing problem with drones in last mile delivery," International Journal of Production Economics, Elsevier, vol. 225(C).
    19. Zhao, Lei & Bi, Xinhua & Li, Gendao & Dong, Zhaohui & Xiao, Ni & Zhao, Anni, 2022. "Robust traveling salesman problem with multiple drones: Parcel delivery under uncertain navigation environments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    20. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    21. Martin Savelsbergh & Tom Van Woensel, 2016. "50th Anniversary Invited Article—City Logistics: Challenges and Opportunities," Transportation Science, INFORMS, vol. 50(2), pages 579-590, May.
    22. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.
    23. Amine Masmoudi, M. & Mancini, Simona & Baldacci, Roberto & Kuo, Yong-Hong, 2022. "Vehicle routing problems with drones equipped with multi-package payload compartments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    24. Wei, Jie & Chang, Meijing, 2023. "Are price matching and logistics service enhancement always effective strategies for improving profitability?," European Journal of Operational Research, Elsevier, vol. 307(1), pages 103-115.
    25. Gao, Jiajing & Zhen, Lu & Laporte, Gilbert & He, Xueting, 2023. "Scheduling trucks and drones for cooperative deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    26. Carlsson, John Gunnar & Behroozi, Mehdi, 2017. "Worst-case demand distributions in vehicle routing," European Journal of Operational Research, Elsevier, vol. 256(2), pages 462-472.
    27. Salama, Mohamed R. & Srinivas, Sharan, 2022. "Collaborative truck multi-drone routing and scheduling problem: Package delivery with flexible launch and recovery sites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    28. Fosgerau, Mogens & Kim, Jinwon & Ranjan, Abhishek, 2018. "Vickrey meets Alonso: Commute scheduling and congestion in a monocentric city," Journal of Urban Economics, Elsevier, vol. 105(C), pages 40-53.
    29. Kim, Nayeon & Montreuil, Benoit & Klibi, Walid & Kholgade, Nitish, 2021. "Hyperconnected urban fulfillment and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    30. Yixiao Huang & Lei Zhao & Warren B. Powell & Yue Tong & Ilya O. Ryzhov, 2019. "Optimal Learning for Urban Delivery Fleet Allocation," Transportation Science, INFORMS, vol. 53(3), pages 623-641, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ren, Xuan & Froger, Aurélien & Jabali, Ola & Liang, Gongqian, 2024. "A competitive heuristic algorithm for vehicle routing problems with drones," European Journal of Operational Research, Elsevier, vol. 318(2), pages 469-485.
    2. Jiang, Jie & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services," European Journal of Operational Research, Elsevier, vol. 312(1), pages 125-137.
    3. Yu, Shaohua & Puchinger, Jakob & Sun, Shudong, 2022. "Van-based robot hybrid pickup and delivery routing problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 894-914.
    4. Li, Hongqi & Chen, Jun & Wang, Feilong & Bai, Ming, 2021. "Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: A review," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1078-1095.
    5. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
    6. Zhao, Lei & Bi, Xinhua & Li, Gendao & Dong, Zhaohui & Xiao, Ni & Zhao, Anni, 2022. "Robust traveling salesman problem with multiple drones: Parcel delivery under uncertain navigation environments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    7. Madani, Batool & Ndiaye, Malick & Salhi, Said, 2024. "Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: Mathematical model and adaptive variable neighborhood search with neighborhood categorization," European Journal of Operational Research, Elsevier, vol. 316(1), pages 100-125.
    8. Meng, Shanshan & Li, Dong & Liu, Jiyin & Chen, Yanru, 2024. "The multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
    9. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2020. "Two-echelon vehicle routing problem with time windows and mobile satellites," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 179-201.
    10. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    11. He, Dongdong & Ceder, Avishai (Avi) & Zhang, Wenyi & Guan, Wei & Qi, Geqi, 2023. "Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    12. Meng, Shanshan & Guo, Xiuping & Li, Dong & Liu, Guoquan, 2023. "The multi-visit drone routing problem for pickup and delivery services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    13. Deng, Menghua & Li, Yuanbo & Ding, Jianpeng & Zhou, Yanlin & Zhang, Lianming, 2024. "Stochastic and robust truck-and-drone routing problems with deadlines: A Benders decomposition approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 190(C).
    14. Yu, Shaohua & Puchinger, Jakob & Sun, Shudong, 2024. "Electric van-based robot deliveries with en-route charging," European Journal of Operational Research, Elsevier, vol. 317(3), pages 806-826.
    15. Salama, Mohamed R. & Srinivas, Sharan, 2022. "Collaborative truck multi-drone routing and scheduling problem: Package delivery with flexible launch and recovery sites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    16. Zhou, Hang & Qin, Hu & Cheng, Chun & Rousseau, Louis-Martin, 2023. "An exact algorithm for the two-echelon vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 124-150.
    17. Yi Li & Min Liu & Dandan Jiang, 2022. "Application of Unmanned Aerial Vehicles in Logistics: A Literature Review," Sustainability, MDPI, vol. 14(21), pages 1-18, November.
    18. Rave, Alexander & Fontaine, Pirmin & Kuhn, Heinrich, 2023. "Drone location and vehicle fleet planning with trucks and aerial drones," European Journal of Operational Research, Elsevier, vol. 308(1), pages 113-130.
    19. He, Dongdong & Guan, Wei, 2023. "Promoting service quality with incentive contracts in rural bus integrated passenger-freight service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    20. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:187:y:2024:i:c:s1366554524001649. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.