The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Dynamic programming approaches for the traveling salesman problem with drone
Open accessAbstract
A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the traveling salesman problem with drone (TSP‐D). This paper presents exact solution approaches for the TSP‐D based on dynamic programming and provides an experimental comparison of these approaches. Our numerical experiments show that our approach can solve larger problems than the mathematical programming approaches that have been presented in the literature thus far. Moreover, we show that restrictions on the number of locations the truck can visit while the drone is away can help significantly reduce the solution times while having relatively little impact on the overall solution quality.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
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
Generalized best-first search strategies and the optimality of A*
Dechter, R., & Pearl, J. (1985) · Journal of the ACM · doi:10.1145/3828.3830 · Cited by 1,071
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
Self-citationDynamic Programming Treatment of the Travelling Salesman Problem
Bellman, R. (1962) · Journal of the ACM · doi:10.1145/321105.321111 · Cited by 808
Psaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
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
Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
Malandraki, C., & Daskin, M. S. (1992) · Transportation Science · doi:10.1287/trsc.26.3.185 · Cited by 541
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
The vehicle routing problem with drones: Extended models and connections
Poikonen, S., Wang, X., & Golden, B. (2017) · Networks · doi:10.1002/net.21746 · Cited by 342
Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm
Mourelo Ferrandez, S., Harbison, T., Weber, T., Sturges, R., & Rich, R. (2016) · Journal of Industrial Engineering and Management · doi:10.3926/jiem.1929 · Cited by 315
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows
Adamo, T., Bektaş, T., Ghiani, G., Guerriero, E., & Manni, E. (2018) · Transportation Science · doi:10.1287/trsc.2017.0816 · Cited by 63
Cited by
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
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
Metadata
- Authors
- Bouman, P., Agatz, N., & Schmidt, M.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 2018-10-25
- Volume
- 72
- Issue
- 4
- Pages
- 528-542
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2754599614
- Cited by
- 360
- References
- 13
- FWCI
- 18.89
- Type
- journal article
- Language
- en
- Open access
- bronze
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.