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
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
Gendreau, M., Laporte, G., & Séguin, R. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00050-x · Cited by 640
Psaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
Self-citationTime 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
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
Gendreau, M., Laporte, G., & Semet, F. (2001) · Parallel Computing · doi:10.1016/s0167-8191(01)00103-x · Cited by 455
A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
Bertsimas, D. J., & van Ryzin, G. (1991) · Operations Research · doi:10.1287/opre.39.4.601 · Cited by 437
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
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
Ghiani, G., Guerriero, F., Laporte, G., & Musmanno, R. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00915-3 · Cited by 350
A dynamic vehicle routing problem with time-dependent travel times
Haghani, A. E., & Jung, S. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2004.04.013 · Cited by 341
MIPLIB 2010: Mixed Integer Programming Library version 5
Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., Danna, E., Gamrath, G., Gleixner, A. M., Heinz, S., et al. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0025-9 · Cited by 321
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
Mitrović-Minić, S., Krishnamurti, R., & Laporte, G. (2004) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2003.09.001 · Cited by 299
Intelligent freight-transportation systems: Assessment and the contribution of operations research
Crainic, T. G., Gendreau, M., & Potvin, J.-Y. (2009) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2008.07.002 · Cited by 291
Real-Time Multivehicle Truckload Pickup and Delivery Problems
Yang, J., Jaillet, P., & Mahmassani, H. (2004) · Transportation Science · doi:10.1287/trsc.1030.0068 · Cited by 280
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
An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
Novoa, C., & Storer, R. H. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.03.023 · Cited by 272
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching
Ichoua, S., Michel Gendreau, A., & Potvin, J. (2006) · Transportation Science · doi:10.1287/trsc.1050.0114 · Cited by 263
Traveling Salesperson Problems for the Dubins Vehicle
Savla, K., Frazzoli, E., & Bullo, F. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.925814 · Cited by 259
Vehicle routing problem with stochastic travel times including soft time windows and service costs
Taş, D., Dellaert, N., Woensel, T. V., & de Kok, A. G. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.06.008 · Cited by 246
Dynamic Vehicle Routing Based on Online Traffic Information
Fleischmann, B., Gnutzmann, S., & Sandvoß, E. (2004) · Transportation Science · doi:10.1287/trsc.1030.0074 · Cited by 224
Adaptive memory programming: A unified view of metaheuristics
Taillard, É. D., Gambardella, L. M., Gendreau, M., & Potvin, J.-Y. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00268-x · Cited by 217
Decision Support for Consumer Direct Grocery Initiatives
Campbell, A. M., & Savelsbergh, M. W. P. (2005) · Transportation Science · doi:10.1287/trsc.1040.0105 · Cited by 197
Bixby, R., & Rothberg, E. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0091-y · Cited by 193
The real-time time-dependent vehicle routing problem
Chen, H.-K., Hsueh, C.-F., & Chang, M. (2005) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2005.01.003 · Cited by 192
Partially dynamic vehicle routing—models and algorithms
Larsen, A., Madsen, O., & Solomon, M. (2002) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601352 · Cited by 186
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2009.06.015 · Cited by 184
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
Secomandi, N., & Margot, F. (2009) · Operations Research · doi:10.1287/opre.1080.0520 · Cited by 171
Dynamic vehicle routing using genetic algorithms
Hanshar, F. T., & Ombuki-Berman, B. M. (2007) · Applied Intelligence · doi:10.1007/s10489-006-0033-z · Cited by 165
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Dabia, S., Ropke, S., van Woensel, T., & De Kok, T. (2013) · Transportation Science · doi:10.1287/trsc.1120.0445 · Cited by 165
Adaptive Memory Programming: A Unified View of Meta-Heuristics
Taillard, É. D., Gambardella, L. M., Michel Gendreau, A., & Potvin, J. (1998) · doi:10.71910/supsi.7446 · Cited by 164
Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
Mes, M., van der Heijden, M., & van Harten, A. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.02.051 · Cited by 163
The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
Xiang, Z., Chu, C., & Chen, H. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2007.01.007 · Cited by 149
On-line algorithms versus off-line algorithms: How much is it worth to know the future?
Karp, R. M. (1993) · Mathematical Social Sciences · doi:10.1016/0165-4896(93)90040-p · Cited by 143
Rutledge, D. B. (2019) · Cambridge University Press eBooks · doi:10.1017/9781139381208.010 · Cited by 138
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
Berbeglia, G., Cordeau, J., & Gilbert Laporte, A. (2011) · INFORMS journal on computing · doi:10.1287/ijoc.1110.0454 · Cited by 123
Ant algorithms with immigrants schemes for the dynamic vehicle routing problem
Mavrovouniotis, M., & Yang, S. (2014) · Information Sciences · doi:10.1016/j.ins.2014.10.002 · Cited by 115
Waiting Strategies for Anticipating Service Requests from Known Customer Locations
Thomas, B. W. (2007) · Transportation Science · doi:10.1287/trsc.1060.0183 · Cited by 114
Ferrucci, F., Bock, S., & Michel Gendreau, A. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.09.016 · Cited by 106
Thomas, B. W., & White, C. C. (2004) · Transportation Science · doi:10.1287/trsc.1030.0071 · Cited by 103
Autonomous dial-a-ride transit introductory overview
Dial, R. B. (1995) · Transportation Research Part C Emerging Technologies · doi:10.1016/0968-090x(95)00010-g · Cited by 99
A Lagrangian heuristic for the real-time vehicle rescheduling problem
Li, J.-Q., Mirchandani, P. B., & Borenstein, D. (2008) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2008.09.002 · Cited by 94
On dynamic pickup and delivery vehicle routing with several time windows and waiting times
Fabri, A., & Recht, P. (2005) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2005.04.002 · Cited by 90
Adaptive granular local search heuristic for a dynamic vehicle routing problem
Branchini, R. M., Armentano, V. A., & Løkketangen, A. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.01.014 · Cited by 85
Robust humanitarian relief logistics network planning
Rezaei-Malek, M., & Tavakkoli-Moghaddam, R. R. (2014) · Uncertain Supply Chain Management · doi:10.5267/j.uscm.2014.1.002 · Cited by 69
A decision support system for optimizing dynamic courier routing operations
Lin, C., Choy, K. L., Ho, G. T. S., et al. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.04.036 · Cited by 65
An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem
Gounaris, C. E., Repoussis, P. P., Tarantilis, C. D., Wiesemann, W., & Floudas, C. A. (2014) · Transportation Science · doi:10.1287/trsc.2014.0559 · Cited by 64
Online Vehicle Routing Problems: A Survey
Jaillet, P., & Wagner, M. R. (2008) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-77778-8_10 · Cited by 60
Real-Time Emergency Response Fleet Deployment: Concepts, Systems, Simulation & Case Studies
Haghani, A. E., & Yang, S. (2008) · Springer eBooks · doi:10.1007/978-0-387-71722-7_7 · Cited by 49
GPU computing in discrete optimization. Part I: Introduction to the GPU
Brodtkorb, A. R., Hagen, T. R., Schulz, C., & Hasle, G. (2013) · EURO Journal on Transportation and Logistics · doi:10.1007/s13676-013-0025-1 · Cited by 43
Online traveling salesman problems with service flexibility
Jaillet, P., & Lu, X. (2011) · Networks · doi:10.1002/net.20454 · Cited by 38
The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem
Sheridan, P. K., Gluck, E., Guan, Q., Pickles, T., Balciog̃lu, B., & Benhabib, B. (2013) · Transportation Research Part A Policy and Practice · doi:10.1016/j.tra.2013.01.032 · Cited by 37
On Dynamic Vehicle Routing With Time Constraints
Bopardikar, S. D., Smith, S. L., & Bullo, F. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2344451 · Cited by 29
A decision support model for establishing an air taxi service: a case study
Fagerholt, K., Foss, B. A., & Horgen, O. J. (2008) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602635 · Cited by 25
Online traveling salesman problem with deadline and advanced information
Wen, X., Xu, Y., & Zhang, H. (2012) · Computers & Industrial Engineering · doi:10.1016/j.cie.2012.07.003 · Cited by 15
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
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.