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

Exact Solution of the Vehicle Routing Problem with Drones

Author

Listed:
  • Jeanette Schmidt

    (Chair of Logistics Management, Department of Business and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany)

  • Christian Tilk

    (Department of Business Decisions and Analytics, University of Vienna, AT-1090 Vienna, Austria)

  • Stefan Irnich

    (Chair of Logistics Management, Department of Business and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany)

Abstract

The vehicle routing problem with drones (VRP-D) that we consider is an extension of the capacitated vehicle routing problem in which the fleet consists of trucks equipped with one drone each. A truck and its drone can either move together or separately. A truck can release its drone at the depot or at a customer location and must pick it up later at another customer or the depot location. In this way, both trucks and drones deliver goods to customers working together as synchronized working units. A feasible route has to satisfy the capacity constraints of both the truck and the drone. A feasible solution to the VRP-D is a set of feasible routes such that each customer is served exactly once by either a truck or a drone. We investigate two standard objectives considered in the literature, that is, the minimization of the total routing cost and the sum of the routes’ durations. To solve the VRP-D exactly, we develop a branch-price-and-cut (BPC) algorithm. In particular, we present a new forward and implicit bidirectional labeling algorithm defined over an artificial network to solve the column-generation subproblems. The new bidirectional labeling algorithm substantially accelerates the solution process compared with its monodirectional counterpart. The time needed to solve the pricing problems is reduced by 55% on average when minimizing routing costs and by 30% when minimizing the sum of the routes’ durations. In further computational experiments, we analyze algorithmic components of the BPC algorithm, compare the cost and duration objectives, and highlight the impact of the drones’ speed on the structure of VRP-D solutions. For the routing-cost minimization objective, our BPC algorithm is able to solve several VRP-D instances with 50 vertices to proven optimality within one hour of computation time. The same instances with duration minimization are more difficult, and the BPC algorithm provides only heuristic solutions with an average gap not exceeding 3%.

Suggested Citation

  • Jeanette Schmidt & Christian Tilk & Stefan Irnich, 2025. "Exact Solution of the Vehicle Routing Problem with Drones," Transportation Science, INFORMS, vol. 59(1), pages 60-80, January.
  • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:1:p:60-80
    DOI: 10.1287/trsc.2024.0544
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2024.0544
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2024.0544?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:59:y:2025:i:1:p:60-80. 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.