The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones
Open accessAbstract
This paper considers a last-mile delivery system in which a delivery truck operates in coordination with a fleet of unmanned aerial vehicles (UAVs, or drones). Deploying UAVs from the truck enables customers located further from the depot to receive drone-based deliveries. The problem is first formulated as a mixed integer linear program (MILP). However, owing to the computational complexity of this problem, only trivially-sized problems may be solved directly via the MILP. Thus, a heuristic solution approach that consists of solving a sequence of three subproblems is proposed. Extensive numerical testing demonstrates that this approach effectively solves problems of practical size within reasonable runtimes. Additional analysis quantifies the potential time savings associated with employing multiple UAVs. The analysis also reveals that additional UAVs may have diminishing marginal returns. An analysis of five different endurance models demonstrates the effects of these models on UAV assignments. The model and heuristic also support anticipated future systems that feature automation for UAV launch and retrieval.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Self-citationVehicle 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 · cited 1×
“A survey of the literature on UAVs for civil applications is provided by Otto et al. (2018).”
BackgroundOn 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
Coordinated Logistics with a Truck and a Drone
Carlsson, J. G., & Song, S. (2018) · Management Science · doi:10.1287/mnsc.2017.2824 · Cited by 425
Multiple traveling salesman problem with drones: Mathematical model and heuristic approach
Kitjacharoenchai, P., Ventresca, M., Moshref‐Javadi, M., Lee, S., Tanchoco, J. M. A., & Brunese, P. A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.01.020 · Cited by 414
Dynamic programming approaches for the traveling salesman problem with drone
Bouman, P., Agatz, N., & Schmidt, M. (2018) · Networks · doi:10.1002/net.21864 · Cited by 360
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
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
Energy consumption models for delivery drones: A comparison and assessment
Zhang, J., Campbell, J. F., Sweeney II, D. C., & Hupman, A. C. (2021) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2020.102668 · Cited by 342
Two echelon vehicle routing problem with drones in last mile delivery
Kitjacharoenchai, P., Min, B.-C., & Lee, S. (2020) · International Journal of Production Economics · doi:10.1016/j.ijpe.2019.107598 · Cited by 332
Cheikhrouhou, O., & Khoufi, I. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100369 · Cited by 290
Comparison of energy demands of drone-based and ground-based parcel delivery services
Kirschstein, T. (2020) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2019.102209 · Cited by 264
Metadata
- Authors
- Murray, C. C., & Raj, R.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 110
- Pages
- 368-398
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2915338839
- Cited by
- 575
- References
- 35
- FWCI
- 32.52
- Type
- journal article
- Language
- en
- Open access
- green
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
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.