IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v44y2022i4d10.1007_s00291-022-00680-1.html
   My bibliography  Save this article

The traveling salesman problem with drone resupply

Author

Listed:
  • Michael Dienstknecht

    (Bergische Universität Wuppertal)

  • Nils Boysen

    (Friedrich-Schiller-Universität Jena)

  • Dirk Briskorn

    (Bergische Universität Wuppertal)

Abstract

This paper treats a variant of the famous Traveling Salesman Problem (TSP), which is extended to cover the peculiarities of a novel, drone-based distribution concept in last-mile logistics. In this context, the salesman represents the driver of a home delivery truck. Given a set of customers to be visited, the truck has a limited capacity, so that only a subset of shipments can be loaded on board when leaving the depot. The remainder of the shipments has to be resupplied to the truck on its tour by a single unmanned aerial vehicle (drone). In order to do so, the drone picks up shipments (one by one) at the depot and delivers them toward the truck. Our extension of the TSP aims at a tour of the truck through the set of given customers and a resupply schedule for the drone, so that the total delivery costs are minimized. We develop suited optimization approaches and apply them in static and dynamic problem settings. We, furthermore, benchmark the savings enabled by drone resupply with alternative home delivery options with and without drone support. Our results show that drone resupply promises substantial rewards when applied in the right delivery context.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:orspec:v:44:y:2022:i:4:d:10.1007_s00291-022-00680-1
    DOI: 10.1007/s00291-022-00680-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-022-00680-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-022-00680-1?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. Boysen, Nils & Schwerdfeger, Stefan & Weidinger, Felix, 2018. "Scheduling last-mile deliveries with truck-based autonomous robots," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1085-1099.
    2. Joonyup Eun & Byung Duk Song & Sangbok Lee & Dae-Eun Lim, 2019. "Mathematical Investigation on the Sustainability of UAV Logistics," Sustainability, MDPI, vol. 11(21), pages 1-15, October.
    3. Renaud Masson & Anna Trentini & Fabien Lehuédé & Nicolas Malhéné & Olivier Péton & Houda Tlahig, 2017. "Optimization of a city logistics transportation system with mixed passengers and goods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 81-109, March.
    4. Mauro Dell’Amico & Roberto Montemanni & Stefano Novellani, 2020. "Matheuristic algorithms for the parallel drone scheduling traveling salesman problem," Annals of Operations Research, Springer, vol. 289(2), pages 211-226, June.
    5. Samuel Pelletier & Ola Jabali & Gilbert Laporte, 2016. "50th Anniversary Invited Article—Goods Distribution with Electric Vehicles: Review and Research Perspectives," Transportation Science, INFORMS, vol. 50(1), pages 3-22, February.
    6. 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.
    7. Boysen, Nils & Schwerdfeger, Stefan & Weidinger, Felix, 2018. "Scheduling last-mile deliveries with truck-based autonomous robots," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 126189, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. 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.
    9. 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.
    10. Snyder, Lawrence V. & Daskin, Mark S., 2006. "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 38-53, October.
    11. 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.
    12. Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.

    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. 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.
    2. Schwerdfeger, Stefan & Boysen, Nils, 2020. "Optimizing the changing locations of mobile parcel lockers in last-mile distribution," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1077-1094.
    3. Ostermeier, Manuel & Heimfarth, Andreas & Hübner, Alexander, 2023. "The multi-vehicle truck-and-robot routing problem for last-mile delivery," European Journal of Operational Research, Elsevier, vol. 310(2), pages 680-697.
    4. 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.
    5. 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.
    6. Wang, Kai & Pesch, Erwin & Kress, Dominik & Fridman, Ilia & Boysen, Nils, 2022. "The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse," European Journal of Operational Research, Elsevier, vol. 296(2), pages 504-519.
    7. Simoni, Michele D. & Kutanoglu, Erhan & Claudel, Christian G., 2020. "Optimization and analysis of a robot-assisted last mile delivery system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    8. 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.
    9. 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.
    10. Chen, Cheng & Demir, Emrah & Huang, Yuan, 2021. "An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1164-1180.
    11. Heimfarth, Andreas & Ostermeier, Manuel & Hübner, Alexander, 2022. "A mixed truck and robot delivery approach for the daily supply of customers," European Journal of Operational Research, Elsevier, vol. 303(1), pages 401-421.
    12. 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.
    13. Sara Reed & Ann Melissa Campbell & Barrett W. Thomas, 2022. "The Value of Autonomous Vehicles for Last-Mile Deliveries in Urban Environments," Management Science, INFORMS, vol. 68(1), pages 280-299, January.
    14. Tiniç, Gizem Ozbaygin & Karasan, Oya E. & Kara, Bahar Y. & Campbell, James F. & Ozel, Aysu, 2023. "Exact solution approaches for the minimum total cost traveling salesman problem with multiple drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 81-123.
    15. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    16. Alfandari, Laurent & Ljubić, Ivana & De Melo da Silva, Marcos, 2022. "A tailored Benders decomposition approach for last-mile delivery with autonomous robots," European Journal of Operational Research, Elsevier, vol. 299(2), pages 510-525.
    17. Boysen, Nils & Schwerdfeger, Stefan & Weidinger, Felix, 2018. "Scheduling last-mile deliveries with truck-based autonomous robots," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1085-1099.
    18. Liu, Dan & Kaisar, Evangelos I. & Yang, Yang & Yan, Pengyu, 2022. "Physical Internet-enabled E-grocery delivery Network:A load-dependent two-echelon vehicle routing problem with mixed vehicles," International Journal of Production Economics, Elsevier, vol. 254(C).
    19. Güneş Erdoğan & E. Alper Y?ld?r?m, 2021. "Exact and Heuristic Algorithms for the Carrier–Vehicle Traveling Salesman Problem," Transportation Science, INFORMS, vol. 55(1), pages 101-121, 1-2.
    20. 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).

    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:spr:orspec:v:44:y:2022:i:4:d:10.1007_s00291-022-00680-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.