The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Vehicle Routing Problems for Drone Delivery
Open accessAbstract
Unmanned aerial vehicles, or drones, have the potential to significantly reduce the cost and time of making last-mile deliveries and responding to emergencies. Despite this potential, little work has gone into developing vehicle routing problems (VRPs) specifically for drone delivery scenarios. Existing VRPs are insufficient for planning drone deliveries: either multiple trips to the depot are not permitted, leading to solutions with excess drones, or the effect of battery and payload weight on energy consumption is not considered, leading to costly or infeasible routes. We propose two multitrip VRPs for drone delivery that address both issues. One minimizes costs subject to a delivery time limit, while the other minimizes the overall delivery time subject to a budget constraint. We mathematically derive and experimentally validate an energy consumption model for multirotor drones, demonstrating that energy consumption varies approximately linearly with payload and battery weight. We use this approximation to derive mixed integer linear programs for our VRPs. We propose a cost function that considers our energy consumption model and drone reuse, and apply it in a simulated annealing (SA) heuristic for finding suboptimal solutions to practical scenarios. To assist drone delivery practitioners with balancing cost and delivery time, the SA heuristic is used to show that the minimum cost has an inverse exponential relationship with the delivery time limit, and the minimum overall delivery time has an inverse exponential relationship with the budget. Numerical results confirm the importance of reusing drones and optimizing battery size in drone delivery VRPs.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Principles of Helicopter Aerodynamics
Leishman, J. G. (2000) · Cited by 2,496
Kellerer, H., Pferschy, U., & Pisinger, D. (2004) · Springer eBooks · doi:10.1007/978-3-540-24777-7 · Cited by 1,824
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
Equation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · doi:10.2172/4390578 · Cited by 1,701
Flying Ad-Hoc Networks (FANETs): A survey
Bekmezci, İ., Sahingoz, O. K., & Temel, Ş. (2013) · Ad Hoc Networks · doi:10.1016/j.adhoc.2012.12.004 · Cited by 1,510
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
Schneider, M., Stenger, A., & Goeke, D. (2014) · Transportation Science · doi:10.1287/trsc.2013.0490 · Cited by 1,312
A Green Vehicle Routing Problem
Erdoğan, S., & Miller-Hooks, E. (2012) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2011.08.001 · Cited by 1,133
Carbon Fibers and Their Composites
Morgan, P. (2005) · CRC Press eBooks · doi:10.1201/9781420028744 · Cited by 1,038
Kleinberg, J. M., & Tardos, É. (2005) · Cited by 1,022
(2010) · Cited by 909
The vehicle routing problem: A taxonomic review
Eksioglu, B., Vural, A. V., & Reisman, A. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.05.009 · Cited by 786
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Xiao, Y., Zhao, Q., Kaku, I., & Xu, Y. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2011.08.013 · Cited by 636
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Energy Minimizing Vehicle Routing Problem
Kara, İ., Kara, B. Y., & Yetis, M. K. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73556-4_9 · Cited by 313
Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots
Sundar, K., & Rathinam, S. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2279544 · Cited by 229
A memetic algorithm for the Multi Trip Vehicle Routing Problem
Cattaruzza, D., Absi, N., Feillet, D., & Vidal, T. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.06.012 · Cited by 178
Guerriero, F., Surace, R., Loscrì, V., & Natalizio, E. (2013) · Applied Mathematical Modelling · doi:10.1016/j.apm.2013.07.002 · Cited by 140
Communication architectures and protocols for networking unmanned aerial vehicles
Li, J., Zhou, Y., & Lamont, L. (2013) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2013.6825193 · Cited by 129
The load-dependent vehicle routing problem and its pick-up and delivery extension
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2014) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2014.11.004 · Cited by 91
Robot Vision: Obstacle-Avoidance Techniques for Unmanned Aerial Vehicles
Carloni, R., Lippiello, V., D'Auria, M., Fumagalli, M., Mersha, A. Y., Stramigioli, S., & Siciliano, B. (2013) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2013.2283632 · Cited by 44
The Deterministic Annealing Algorithms for Vehicle Routing Problems
Kaku, I., Xiao, Y., & Xia, G. (2003) · International Journal of Smart Engineering System Design · doi:10.1080/10255810390224080 · Cited by 19
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“[55] M, P, H, Exp drone minimum turning radius general [68] M, MH, EmpCS, Exp several drones limited carrying capacity, energy consumption depends on the drone’s weight transport”
BackgroundInfluentialMobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning
Jeong, S., Simeone, O., & Kang, J. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2706308 · Cited by 812
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
Blockchain and Cryptocurrencies: Model, Techniques, and Applications
Yuan, Y., & Wang, F.-Y. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2018.2854904 · Cited by 503
Metadata
- Authors
- Dorling, K., Heinrichs, J., Messier, G. G., & Magierowski, S.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2017-01
- Volume
- 47
- Issue
- 1
- Pages
- 70-85
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W2471190594
- Cited by
- 1,326
- References
- 23
- FWCI
- 90.22
- 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.