IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v55y2021i5p1088-1112.html
   My bibliography  Save this article

An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem

Author

Listed:
  • Munjeong Kang

    (Department of Industrial and Management Engineering, Hankuk University of Foreign Studies, Yongin-si, Gyeonggi-do 17035, Korea)

  • Chungmok Lee

    (Department of Industrial and Management Engineering, Hankuk University of Foreign Studies, Yongin-si, Gyeonggi-do 17035, Korea)

Abstract

Recently, there are attempts to utilize drones in the logistic application. We consider the case in which there are multiple drones with different characteristics, such as speed and battery capacity. The truck and drone collaborate the delivery to serve all customers, while the drones are carried by and dispatched from the truck. The multiple drones can be deployed simultaneously; however, the truck must wait until all drones return. Therefore, the goal is to minimize the total sum of truck travel and waiting times for drones to return after deliveries. We call the proposed model a heterogeneous drone-truck routing problem (HDTRP), and a mixed-integer programming formulation for the problem is presented. We develop an exact algorithm based on the logic-based Benders decomposition approach, which outperforms the state-of-the-art solvers.

Suggested Citation

  • Munjeong Kang & Chungmok Lee, 2021. "An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem," Transportation Science, INFORMS, vol. 55(5), pages 1088-1112, September.
    • Handle: RePEc:inm:ortrsc:v:55:y:2021:i:5:p:1088-1112
    DOI: 10.1287/trsc.2021.1055
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1055
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1055?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
    ---><---

    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:ortrsc:v:55:y:2021:i:5:p:1088-1112. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.