The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Dynamic vehicle routing problems: Three decades and counting
Open accessAbstract
Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing a real explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the nature of the dynamic element, (10) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis‐à‐vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit linkages of methodology to technological advances and analysis of worst case or average case performance of heuristics. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 67(1), 3–31 2016
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
Cramming More Components onto Integrated Circuits (1965)
Moore, G. (2021) · Ideas That Created the Future · doi:10.7551/mitpress/12274.003.0027 · Cited by 6,241
Cramming More Components Onto Integrated Circuits
Moore, G. E. (1998) · Proceedings of the IEEE · doi:10.1109/jproc.1998.658762 · Cited by 5,926
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Data-intensive applications, challenges, techniques and technologies: A survey on Big Data
Philip Chen, C. L., & Zhang, C.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.015 · Cited by 3,047
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
A review of dynamic vehicle routing problems
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.08.015 · Cited by 1,253
Bektaş, T., & Laporte, G. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2011.02.004 · Cited by 1,219
Vehicle Routing: Problems, Methods, and Applications, Second Edition
(2014) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973594 · Cited by 1,131
Ambulance location and relocation models
Brotcorne, L., Gilbert Laporte, A., & Semet, F. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00364-8 · Cited by 813
Vehicle dispatching with time-dependent travel times
Ichoua, S., Michel Gendreau, A., & Potvin, J. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00147-9 · Cited by 690
Cited by
A review of dynamic vehicle routing problems
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.08.015 · Cited by 1,253
Ant Colony System for a Dynamic Vehicle Routing Problem
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005) · Journal of Combinatorial Optimization · doi:10.1007/s10878-005-4922-6 · Cited by 414
Pisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
Hyland, M., & Mahmassani, H. S. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.05.003 · Cited by 286
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
Bertsimas, D. J., & van Ryzin, G. (1993) · Operations Research · doi:10.1287/opre.41.1.60 · Cited by 274
Metadata
- Authors
- Psaraftis, H. N., Wen, M., & Kontovas, C. A.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 2015-08-17
- Volume
- 67
- Issue
- 1
- Pages
- 3-31
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2112686410
- Cited by
- 709
- References
- 63
- FWCI
- 61.50
- 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: Dynamic vehicle routing problems: Three decades and counting. https://app.cochat.ai/papers/10.1002/net.21628
- The paper
- Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016). Dynamic vehicle routing problems: Three decades and counting. Networks. https://doi.org/10.1002/net.21628
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.
