The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A matheuristic for the vehicle routing problem with drones and its variants
Abstract
Abstract In this work, we are interested in studying the Vehicle Routing Problem with Drones (VRPD). Given a fleet of trucks, where each truck carries a given number of drones, the objective consists in designing feasible routes and drone operations such that all customers are served and minimal makespan is achieved. We formulate the VRPD as a Mixed Integer Linear Program (MILP), which can be solved by any standard MILP solver. Moreover, with the aim of improving the performance of solvers, we introduce several sets of valid inequalities (VIEQ). Due to limited performance of the solvers in addressing large instances, we propose a matheuristic approach that effectively exploits the problem structure of the VRPD. Integral to this approach, we propose the Drone Assignment and Scheduling Problem (DASP) that, given an existing routing of trucks, looks for an optimal assignment and schedule of drones such that the makespan is minimized. In this context, we propose two MILP formulations for the DASP. In order to evaluate the performance of a state-of-the-art solver in tackling the MILP formulation of the VRPD, the benefit of the proposed VIEQs, and the performance of the matheuristic, we carried out extensive computational experiments. According to the numerical results, the use of drones can significantly reduce the makespan and the proposed VIEQ as well as the matheuristic approach have a significant contribution in solving the VRPD effectively.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery
Murray, C. C., & Chu, A. G. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.03.005 · Cited by 1,715
Vehicle Routing Problems for Drone Delivery
Dorling, K., Heinrichs, J., Messier, G. G., & Magierowski, S. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2582745 · Cited by 1,326
Optimization Approaches for the Traveling Salesman Problem with Drone
Agatz, N., Bouman, P., & Schmidt, M. (2018) · Transportation Science · doi:10.1287/trsc.2017.0791 · Cited by 1,029
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
On the min-cost Traveling Salesman Problem with Drone
Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.11.015 · Cited by 622
An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
Sacramento, D., Pisinger, D., & Ropke, S. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.02.018 · Cited by 563
The vehicle routing problem with drones: several worst-case results
Wang, X., Poikonen, S., & Golden, B. (2017) · Optimization Letters · doi:10.1007/s11590-016-1035-3 · Cited by 551
50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art
(2010) · Springer eBooks · doi:10.1007/978-3-540-68279-0 · Cited by 534
Cited by
Last-mile delivery concepts: a survey from an operational research perspective
Boysen, N., Fedtke, S., & Schwerdfeger, S. (2021) · OR Spectrum · doi:10.1007/s00291-020-00607-8 · Cited by 621
The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones
Murray, C. C., & Raj, R. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.11.003 · Cited by 575
Drone-aided routing: A literature review
Macrina, G., Di Puglia Pugliese, L., Guerriero, F., & Laporte, G. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2020.102762 · Cited by 522
Chung, S. H., Sah, B., & Lee, J. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.105004 · Cited by 441
Applications and Research avenues for drone-based models in logistics: A classification and review
Moshref-Javadi, M., & Winkenbach, M. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114854 · Cited by 391
Metadata
- Authors
- Schermer, D., Moeini, M., & Wendt, O.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2019-09
- Volume
- 106
- Pages
- 166-204
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2963624642
- Cited by
- 278
- References
- 16
- FWCI
- 16.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A matheuristic for the vehicle routing problem with drones and its variants. https://app.cochat.ai/papers/10.1016/j.trc.2019.06.016
- The paper
- Schermer, D., Moeini, M., & Wendt, O. (2019). A matheuristic for the vehicle routing problem with drones and its variants. Transportation Research Part C: Emerging Technologies. https://doi.org/10.1016/j.trc.2019.06.016
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.