Exact Solution of the Vehicle Routing Problem With Drones

Jeanette Schmidt (), Christian Tilk () and Stefan Irnich ()
Additional contact information
Jeanette Schmidt: Johannes Gutenberg University Mainz
Christian Tilk: University of Vienna
Stefan Irnich: Johannes Gutenberg University Mainz

No 2311, Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz

Abstract: The vehicle routing problem with drones (VRP-D) 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. To operate alone, a truck can release its drone at the depot or at a customer location and likewise pick it up at a later location visited by the same truck. 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. The VRP-D consists of finding a minimum-cost set of feasible routes such that each customer is served exactly once by either a truck or a drone. We develop a branch-price-and-cut (BPC) algorithm to solve the VRP-D exactly for both standard objectives considered in the literature, i.e., the minimization of the total routing cost and the sum of the routes' durations. To solve the column-generation subproblems, we present a new forward and implicit bidirectional labeling algorithm defined over an artificial network. The new bidirectional labeling algorithm substantially accelerates the solution process compared its monodirectional counterpart. In several 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. The final version of the BPC algorithm is able to solve VRP-D instances with up to 50 vertices to proven optimality within one hour of computation time.

Keywords: routing; drone delivery; synchronization; branch-price-and-cut; bidirectional labeling (search for similar items in EconPapers)
Pages: 31 pages
Date: 2023-05-24
New Economics Papers: this item is included in nep-cmp and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_2311.pdf First version, 2023 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jgu:wpaper:2311

Access Statistics for this paper

More papers in Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz Contact information at EDIRC.
Bibliographic data for series maintained by Research Unit IPP ().