IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v31y2019i2p335-346.html
   My bibliography  Save this article

A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone

Author

Listed:
  • Stefan Poikonen

    (Business School, University of Colorado Denver, Denver, Colorado 80202)

  • Bruce Golden

    (R.H. Smith School of Business, University of Maryland, College Park, Maryland 20742; c Kogod School of Business, American University, Washington, District of Columbia 20016)

  • Edward A. Wasil

    (Kogod School of Business, American University, Washington, District of Columbia 20016)

Abstract

The Traveling Salesman Problem with a Drone (TSP-D) is a hybrid truck and drone model of delivery, in which the drone rides on the truck and launches from the truck to deliver packages. Our approach to the TSP-D uses branch and bound, whereby each node of the branch-and-bound tree corresponds with a potential order to deliver a subset of packages. An approximate lower bound at each node is given by solving a dynamic program. We provide additional variants of our heuristic approach and compare solution quality and computation times. Consideration is given to various input parameters and distance metrics.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:orijoc:v:31:y:2019:i:2:p:335-346
    DOI: 10.1287/ijoc.2018.0826
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2018.0826
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2018.0826?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
    ---><---

    References listed on IDEAS

    as
    1. Walton Pereira Coutinho & Roberto Quirino do Nascimento & Artur Alves Pessoa & Anand Subramanian, 2016. "A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 752-765, November.
    2. 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. Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.
    2. 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.
    3. 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).
    4. 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.
    5. 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.
    6. Yang Xia & Wenjia Zeng & Xinjie Xing & Yuanzhu Zhan & Kim Hua Tan & Ajay Kumar, 2023. "Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing," Annals of Operations Research, Springer, vol. 327(1), pages 89-127, August.
    7. Vincent F. Yu & Shih-Wei Lin & Panca Jodiawan & Yu-Chi Lai, 2023. "Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic," Mathematics, MDPI, vol. 11(20), pages 1-21, October.
    8. 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).
    9. 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.
    10. Lixin Shen & Jie Sun & Dong Yang, 2024. "Research on Path Optimization for Collaborative UAVs and Mothership Monitoring of Air Pollution from Port Vessels," Sustainability, MDPI, vol. 16(12), pages 1-33, June.
    11. Yin, Yunqiang & Li, Dongwei & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Wang, Sutong, 2023. "A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1125-1144.
    12. Jeong, Ho Young & Yu, David J. & Min, Byung-Cheol & Lee, Seokcheon, 2020. "The humanitarian flying warehouse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    13. Kloster, Konstantin & Moeini, Mahdi & Vigo, Daniele & Wendt, Oliver, 2023. "The multiple traveling salesman problem in presence of drone- and robot-supported packet stations," European Journal of Operational Research, Elsevier, vol. 305(2), pages 630-643.
    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. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Parragh, Sophie N., 2024. "Synchronisation in vehicle routing: Classification schema, modelling framework and literature review," European Journal of Operational Research, Elsevier, vol. 313(3), pages 817-840.
    16. 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.
    17. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    18. Zhang, Guowei & Zhu, Ning & Ma, Shoufeng & Xia, Jun, 2021. "Humanitarian relief network assessment using collaborative truck-and-drone system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    19. Wusheng Liu & Wang Li & Qing Zhou & Qian Die & Yan Yang, 2022. "The optimization of the "UAV-vehicle" joint delivery route considering mountainous cities," PLOS ONE, Public Library of Science, vol. 17(3), pages 1-21, March.
    20. Chen, Heng & Hu, Zhangchen & Solak, Senay, 2021. "Improved delivery policies for future drone-based delivery systems," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1181-1201.

    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:inm:orijoc:v:31:y:2019:i:2:p:335-346. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.