The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A hybrid genetic algorithm for the traveling salesman problem with drone
Open accessAbstract
This paper addresses the traveling salesman problem with drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to either minimize the total operational cost (min-cost TSP-D) or minimize the completion time for the truck and drone (min-time TSP-D). This problem has gained a lot of attention in the last few years reflecting the recent trends in a new delivery method among logistics companies. To solve the TSP-D, we propose a hybrid genetic search with dynamic population management and adaptive diversity control based on a split algorithm, problem-tailored crossover and local search operators, a new restore method to advance the convergence and an adaptive penalization mechanism to dynamically balance the search between feasible/infeasible solutions. The computational results show that the proposed algorithm outperforms two existing methods in terms of solution quality and improves many best known solutions found in the literature. Moreover, various analyses on the impacts of crossover choice and heuristic components have been conducted to investigate their sensitivity to the performance of our method.
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
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
Cited by
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
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
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
- Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H.
- Venue
- Journal of Heuristics
- Published
- 2019-11-13
- Volume
- 26
- Issue
- 2
- Pages
- 219-247
- ISSN
- 1381-1231 (ISSN-L)
- 1572-9397
- OpenAlex
- W2905789584
- Cited by
- 181
- References
- 1
- FWCI
- 13.38
- 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
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 hybrid genetic algorithm for the traveling salesman problem with drone. https://app.cochat.ai/papers/10.1007/s10732-019-09431-y
- The paper
- Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H. (2020). A hybrid genetic algorithm for the traveling salesman problem with drone. Journal of Heuristics. https://doi.org/10.1007/s10732-019-09431-y
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.