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

Logic-based benders decomposition algorithm for robust parallel drone scheduling problem considering uncertain travel times for drones

Author

Listed:
  • Barzanjeh, Shakoor
  • Ahmadizar, Fardin
  • Arkat, Jamal

Abstract

The integration of trucks and drones in last-mile delivery has introduced new capabilities to the transportation industry. These two vehicles simultaneously offer unique features, which have improved performance and efficiency in the process of delivering products. This paper investigates a robust parallel drone scheduling traveling salesman problem with supporting drone, where drone travel times are uncertain and products gradually arrive at a depot over time. In this problem, a truck, a supporting drone, and service drones are located in the depot to deliver products with the goal of minimizing the total completion time. A mathematical model is proposed which is improved using the earliest release dates rule, followed by the development of an exact logic-based benders decomposition algorithm to solve the problem. In this algorithm, customers are initially assigned to the service drones or the truck in a master problem, and subsequent auxiliary problems are addressed utilizing the earliest release dates rule and a dynamic programming algorithm. Finally, various cuts are enhanced through strengthening techniques and sequentially added into the master problem. Numerical experiments demonstrate the efficiency of the improved mathematical model and the proposed algorithm. Furthermore, sensitivity analysis has provided several managerial recommendations for enhancing the delivery system performance.

Suggested Citation

  • Barzanjeh, Shakoor & Ahmadizar, Fardin & Arkat, Jamal, 2025. "Logic-based benders decomposition algorithm for robust parallel drone scheduling problem considering uncertain travel times for drones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    • Handle: RePEc:eee:transe:v:193:y:2025:i:c:s136655452400468x
    DOI: 10.1016/j.tre.2024.103877
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655452400468X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103877?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. Said Dabia & Emrah Demir & Tom Van Woensel, 2017. "An Exact Approach for a Variant of the Pollution-Routing Problem," Transportation Science, INFORMS, vol. 51(2), pages 607-628, May.
    2. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates," Transportation Science, INFORMS, vol. 50(2), pages 676-693, May.
    3. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    4. Pedro Munari & Alfredo Moreno & Jonathan De La Vega & Douglas Alem & Jacek Gondzio & Reinaldo Morabito, 2019. "The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method," Transportation Science, INFORMS, vol. 53(4), pages 1043-1066, July.
    5. Iman Dayarian & Martin Savelsbergh & John-Paul Clarke, 2020. "Same-Day Delivery with Drone Resupply," Transportation Science, INFORMS, vol. 54(1), pages 229-249, January.
    6. Minh Anh Nguyen & Minh Hoàng Hà, 2023. "The Parallel Drone Scheduling Traveling Salesman Problem with Collective Drones," Transportation Science, INFORMS, vol. 57(4), pages 866-888, July.
    7. Wang, Xin & Jiang, Ruiwei & Qi, Mingyao, 2023. "A robust optimization problem for drone-based equitable pandemic vaccine distribution with uncertain supply," Omega, Elsevier, vol. 119(C).
    8. Michael Dienstknecht & Nils Boysen & Dirk Briskorn, 2022. "The traveling salesman problem with drone resupply," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1045-1086, December.
    9. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    10. 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.
    11. Pina-Pardo, Juan C. & Silva, Daniel F. & Smith, Alice E. & Gatica, Ricardo A., 2024. "Fleet resupply by drones for last-mile delivery," European Journal of Operational Research, Elsevier, vol. 316(1), pages 168-182.
    12. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    13. 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).
    14. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    15. Mbiadou Saleu, Raïssa G. & Deroussi, Laurent & Feillet, Dominique & Grangeon, Nathalie & Quilliot, Alain, 2022. "The parallel drone scheduling problem with multiple drones and vehicles," European Journal of Operational Research, Elsevier, vol. 300(2), pages 571-589.
    16. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    17. 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.
    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. Pina-Pardo, Juan C. & Silva, Daniel F. & Smith, Alice E. & Gatica, Ricardo A., 2024. "Fleet resupply by drones for last-mile delivery," European Journal of Operational Research, Elsevier, vol. 316(1), pages 168-182.
    2. Ramadhan, Fadillah & Irawan, Chandra Ade & Salhi, Said & Cai, Zhao, 2025. "The truck traveling salesman problem with drone and boat for humanitarian relief distribution in flood disaster: Mathematical model and solution methods," European Journal of Operational Research, Elsevier, vol. 322(1), pages 270-291.
    3. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    4. 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).
    5. Liu, Wenqian & Liu, Lindong & Qi, Xiangtong, 2024. "Drone resupply with multiple trucks and drones for on-time delivery along given truck routes," European Journal of Operational Research, Elsevier, vol. 318(2), pages 457-468.
    6. Dukkanci, Okan & Campbell, James F. & Kara, Bahar Y., 2024. "Facility location decisions for drone delivery: A literature review," European Journal of Operational Research, Elsevier, vol. 316(2), pages 397-418.
    7. Zhang, Li & Liu, Zhongshan & Yu, Lan & Fang, Ke & Yao, Baozhen & Yu, Bin, 2022. "Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    8. 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).
    9. Jeong, Jaehee & Premsankar, Gopika & Ghaddar, Bissan & Tarkoma, Sasu, 2024. "A robust optimization approach for placement of applications in edge computing considering latency uncertainty," Omega, Elsevier, vol. 126(C).
    10. 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).
    11. Carolin Bauerhenne & Jonathan Bard & Rainer Kolisch, 2024. "Robust Routing and Scheduling of Home Healthcare Workers: A Nested Branch-and-Price Approach," Papers 2407.06215, arXiv.org.
    12. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    13. Cui, Haipeng & Li, Keyu & Jia, Shuai & Meng, Qiang, 2024. "Dynamic collaborative truck-drone delivery with en-route synchronization and random requests," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    14. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    15. Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.
    16. Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
    17. Shi, Yong & Yang, Junhao & Han, Qian & Song, Hao & Guo, Haixiang, 2024. "Optimal decision-making of post-disaster emergency material scheduling based on helicopter–truck–drone collaboration," Omega, Elsevier, vol. 127(C).
    18. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    19. Martin Wölck & Stephan Meisel, 2022. "Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2192-2211, July.
    20. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(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:eee:transe:v:193:y:2025:i:c:s136655452400468x. 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.