The vehicle routing problem: State of the art classification and review
Open accessThe DOI matches its Crossref record; 112 of the 112 references it cites were found in a registry or an index.
Abstract
Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever more popular in the academic literature. Yet, the problem characteristics and assumptions vary widely and few literature reviews have made an effort to classify the existing articles accordingly. In this article, we present a taxonomic review of the VRP literature published between 2009 and June 2015. Based on an adapted version of an existing comprehensive taxonomy, we classify 277 articles and analyze the trends in the VRP literature. This classification is the first to categorize the articles to this level of detail.
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
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
Dantzig, G. B., & Ramser, J. H. (1959) · Management Science · doi:10.1287/mnsc.6.1.80 · Cited by 4,985
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
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
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
The Vehicle Routing Problem: Latest Advances and New Challenges
(2008) · Operations Research/Computer Science Interfaces · doi:10.1007/978-0-387-77778-8 · Cited by 1,483
Cited by
A survey of models and algorithms for optimizing shared mobility
Mourad, A., Puchinger, J., & Chu, C. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.02.003 · Cited by 309
Green vehicle routing problem: A state-of-the-art review
Asghari, M., & Mirzapour Al-e-hashem, S. M. J. (2021) · International Journal of Production Economics · doi:10.1016/j.ijpe.2020.107899 · Cited by 309
The hybrid vehicle-drone routing problem for pick-up and delivery services
Karak, A., & Abdelghany, K. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.03.021 · Cited by 294
Cheikhrouhou, O., & Khoufi, I. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100369 · Cited by 290
Erdinç, O., Yetilmezsoy, K., Erenoğlu, A. K., & Erdinç, O. (2019) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2019.06.295 · Cited by 51
Vehicle routing problems with road‐network information: State of the art
Ben Ticha, H., Absi, N., Feillet, D., & Quilliot, A. (2018) · Networks · doi:10.1002/net.21808 · Cited by 51
Metadata
- Authors
- Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2016-09
- Volume
- 99
- Pages
- 300-313
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2262276395
- Cited by
- 1,265
- References
- 112
- FWCI
- 87.86
- 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.