IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i17p13235-d1232418.html
   My bibliography  Save this article

Research on Logistics Path Optimization for a Two-Stage Collaborative Delivery System Using Vehicles and UAVs

Author

Listed:
  • Qiqian Zhang

    (College of Civil Aviation, Nanjing University of Aeronautics & Astronautics, Nanjing 211106, China)

  • Xiao Huang

    (College of Civil Aviation, Nanjing University of Aeronautics & Astronautics, Nanjing 211106, China)

  • Honghai Zhang

    (College of Civil Aviation, Nanjing University of Aeronautics & Astronautics, Nanjing 211106, China)

  • Chunyun He

    (College of Civil Aviation, Nanjing University of Aeronautics & Astronautics, Nanjing 211106, China)

Abstract

A two-stage planning model for the carrier–vehicle problem with drone (CVP-D) is established in this paper, with the objective of minimizing the delivery time of the drone and the distance traveled by the truck while considering the impact of payload on the drone flight distance. Firstly, based on the customer coordinates, an improved K-Means ++ clustering algorithm is designed to plan the vehicle stopping points, and the vehicle departs from the warehouse to traverse all stopping points in order. Based on the vehicle stopping points, a multi-chromosome genetic algorithm is designed to optimize the vehicle driving path. Then, the drone route is optimized without considering the no-fly zone. Finally, the real data of Jiangsu Province are introduced as a case study to calculate the cost and total time required before and after improvement. The results showed an approximate savings of 16% in time and 19% in cost.

Suggested Citation

  • Qiqian Zhang & Xiao Huang & Honghai Zhang & Chunyun He, 2023. "Research on Logistics Path Optimization for a Two-Stage Collaborative Delivery System Using Vehicles and UAVs," Sustainability, MDPI, vol. 15(17), pages 1-20, September.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:17:p:13235-:d:1232418
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/17/13235/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/17/13235/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. John Gunnar Carlsson & Siyuan Song, 2018. "Coordinated Logistics with a Truck and a Drone," Management Science, INFORMS, vol. 64(9), pages 4052-4069, September.
    2. Stefan Poikonen & Bruce Golden & Edward A. Wasil, 2019. "A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 335-346, April.
    3. 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.
    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. 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.
    2. 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.
    3. Xia, Yang & Zeng, Wenjia & Zhang, Canrong & Yang, Hai, 2023. "A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 80-110.
    4. 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).
    5. Sandun Perera & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2020. "Retail Deliveries by Drones: How Will Logistics Networks Change?," Production and Operations Management, Production and Operations Management Society, vol. 29(9), pages 2019-2034, September.
    6. 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.
    7. 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.
    8. Zhang, Juan & Campbell, James F. & Sweeney, Donald C., 2024. "A continuous approximation approach to integrated truck and drone delivery systems," Omega, Elsevier, vol. 126(C).
    9. 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.
    10. Zhu, Waiming & Hu, Xiaoxuan & Pei, Jun & Pardalos, Panos M., 2024. "Minimizing the total travel distance for the locker-based drone delivery: A branch-and-cut-based method," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    11. 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.
    12. Liu, Zeyu & Li, Xueping & Khojandi, Anahita, 2022. "The flying sidekick traveling salesman problem with stochastic travel time: A reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    13. 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).
    14. Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.
    15. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
    16. Luigi Di Puglia Pugliese & Francesca Guerriero & Maria Grazia Scutellá, 2021. "The Last-Mile Delivery Process with Trucks and Drones Under Uncertain Energy Consumption," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 31-67, October.
    17. 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.
    18. Tengkuo Zhu & Stephen D. Boyles & Avinash Unnikrishnan, 2024. "Battery Electric Vehicle Traveling Salesman Problem with Drone," Networks and Spatial Economics, Springer, vol. 24(1), pages 49-97, March.
    19. Snežana Tadić & Mladen Krstić & Ljubica Radovanović, 2024. "Assessing Strategies to Overcome Barriers for Drone Usage in Last-Mile Logistics: A Novel Hybrid Fuzzy MCDM Model," Mathematics, MDPI, vol. 12(3), pages 1-25, January.
    20. 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).

    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:gam:jsusta:v:15:y:2023:i:17:p:13235-:d:1232418. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.