The DOI matches its Crossref record; 82 of the 82 references it cites were found in a registry or an index.
A review of dynamic vehicle routing problems
Open accessAbstract
A number of technological advances have led to a renewed interest in dynamic vehicle routing problems. This survey classifies routing problems from the perspective of information quality and evolution. After presenting a general description of dynamic routing, we introduce the notion of degree of dynamism, and present a comprehensive review of applications and solution methods for dynamic vehicle routing problems.
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
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
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Online Computation and Competitive Analysis
Borodin, A., & El‐Yaniv, R. (1998) · Cited by 2,333
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Powell, W. B. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9781118029176 · Cited by 2,297
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
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
Operations research at container terminals: a literature update
Stahlbock, R., & Voß, S. (2007) · OR Spectrum · doi:10.1007/s00291-007-0100-9 · Cited by 1,070
(1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0029723 · Cited by 1,049
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Taillard, É. D., Badeau, P., Michel Gendreau, A., Guertin, F., & Potvin, J. (1997) · Transportation Science · doi:10.1287/trsc.31.2.170 · Cited by 957
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
The vehicle routing problem: A taxonomic review
Eksioglu, B., Vural, A. V., & Reisman, A. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.05.009 · Cited by 786
Dynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
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
The Traveling-Salesman Problem
Flood, M. M. (1956) · Operations Research · doi:10.1287/opre.4.1.61 · Cited by 682
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
Approximate dynamic programming: solving the curses of dimensionality
Pardalos, P. M. (2009) · Optimization Methods and Software · doi:10.1080/10556780802583108 · Cited by 666
Gendreau, M., Laporte, G., & Séguin, R. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00050-x · Cited by 640
Self-citationPsaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
Verweij, B., Ahmed, S., Kleywegt, A. J., Nemhauser, G. L., & Shapiro, A. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021814225969 · Cited by 494
Fleet Management and Logistics
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5 · Cited by 485
Powell, W. B. (2007) · Cited by 471
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
Self-citationA 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
The Vehicle Routing Problem with Stochastic Travel Times
Laporte, G., Louveaux, F., & Mercure, H. (1992) · Transportation Science · doi:10.1287/trsc.26.3.161 · Cited by 435
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
What you should know about the vehicle routing problem
Gilbert Laporte, A. (2007) · Naval Research Logistics (NRL) · doi:10.1002/nav.20261 · Cited by 329
Stochastic Vehicle Routing with Random Travel Times
Kenyon, A. S., & Morton, D. P. (2003) · Transportation Science · doi:10.1287/trsc.37.1.69.12820 · Cited by 300
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
Self-citationAn Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
Laporte, G., Louveaux, F. V., & van Hamme, L. (2002) · Operations Research · doi:10.1287/opre.50.3.415.7751 · Cited by 289
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Dror, M., Laporte, G., & Trudeau, P. (1989) · Transportation Science · doi:10.1287/trsc.23.3.166 · Cited by 286
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
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
Diversion Issues in Real-Time Vehicle Dispatching
Ichoua, S., Michel Gendreau, A., & Potvin, J. (2000) · Transportation Science · doi:10.1287/trsc.34.4.426.12325 · Cited by 243
Optimal Vehicle Routing With Real-Time Traffic Information
Kim, S., Lewis, M. E., & White, C. C. (2005) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2005.848362 · Cited by 236
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
Self-citationThe Dynamic Vehicle Routing Problem
Larsen, A. (2000) · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · Cited by 211
Ant colony optimization for real-world vehicle routing problems: From theory to applications
Rizzoli, A. E., Montemanni, R., Lucibello, E., & Gambardella, L. M. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0005-x · Cited by 202
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
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
Self-citationAn Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application
Simão, H. P., Day, J., George, A. P., Gifford, T., Nienow, J., & Powell, W. B. (2009) · Transportation Science · doi:10.1287/trsc.1080.0238 · Cited by 182
Online Stochastic Combinatorial Optimization
Hentenryck, P. V., & Bent, R. W. (2006) · The MIT Press eBooks · doi:10.7551/mitpress/5140.001.0001 · Cited by 178
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 178
What you should know about approximate dynamic programming
Powell, W. B. (2009) · Naval Research Logistics (NRL) · doi:10.1002/nav.20347 · Cited by 175
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
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 Dynamic Assignment Problem
Spivey, M. Z., & Powell, W. B. (2004) · Transportation Science · doi:10.1287/trsc.1030.0073 · Cited by 155
A dial-a-ride problem for client transportation in a health-care organization
Melachrinoudis, E., Ilhan, A. B., & Min, H. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.03.024 · Cited by 154
Rutledge, D. B. (2019) · Cambridge University Press eBooks · doi:10.1017/9781139381208.010 · Cited by 138
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 117
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
Stochastic Programming in Transportation and Logistics
Powell, W. B., & Topaloğlu, H. (2003) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(03)10009-6 · Cited by 109
Ferrucci, F., Bock, S., & Michel Gendreau, A. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.09.016 · Cited by 106
Horn, M. (2002) · Transportation Research Part A Policy and Practice · doi:10.1016/s0965-8564(00)00043-4 · Cited by 105
Thomas, B. W., & White, C. C. (2004) · Transportation Science · doi:10.1287/trsc.1030.0071 · Cited by 103
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 102
Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information
GÜNER, A. R., Murat, A., & Chinnam, R. B. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.04.012 · Cited by 101
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
Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information
Regan, A., Mahmassani, H. S., & Jaillet, P. (1996) · Transportation Research Record Journal of the Transportation Research Board · doi:10.1177/0361198196153700113 · Cited by 92
Evaluation of Dynamic Fleet Management Systems: Simulation Framework
Regan, A., Mahmassani, H. S., & Jaillet, P. (1998) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1645-22 · Cited by 88
Dynamic Fleet Management: Concepts, Systems, Algorithms & Case Studies
Zeimpekis, V., Tarantilis, C. D., Minis, I. E., & Giaglis, G. M. (2007) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-71722-7 · Cited by 87
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
Horn, M. (2004) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2002.08.001 · Cited by 69
Regan, A., Mahmassani, H. S., & Jaillet, P. (1995) · Transportation Research Record Journal of the Transportation Research Board · Cited by 67
Planned Route Optimization For Real-Time Vehicle Routing
Ichoua, S., Michel Gendreau, A., & Potvin, J. (2008) · Springer eBooks · doi:10.1007/978-0-387-71722-7_1 · Cited by 66
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 65
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
Regrets only! online stochastic optimization under time constraints
Bent, R. W., & Hentenryck, P. V. (2004) · Cited by 60
The value of consensus in online stochastic scheduling
Bent, R. W., & Hentenryck, P. V. (2004) · International Conference on Automated Planning and Scheduling · Cited by 54
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Powell, W. B. (2007) · Cited by 50
Ant colony optimization for vehicle routing in advanced logistics systems
Maria, G. L., Emilio, R. A., Oliverio, F., Casagrande, N., Donati, A., Montemanni, R., & Lucibello, E. (2003) · IRIS UNIMORE (University of Modena and Reggio Emilia) · Cited by 49
Ant colony optimization for real-world vehicle routing problems
Coltorti, D., & Rizzoli, A. E. (2007) · ACM SIGEVOlution · doi:10.1145/1329465.1329466 · Cited by 30
Balev, S., Guinand, F., Lesauvage, G., & Olivier, D. (2009) · Cited by 8
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611675114 · Cited by 1,186
Planning and Decision-Making for Autonomous Vehicles
Schwarting, W., Alonso-Mora, J., & Rus, D. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105157 · Cited by 972
Dynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
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
Metadata
- Authors
- Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2013-02
- Volume
- 225
- Issue
- 1
- Pages
- 1-11
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2031236641
- Cited by
- 1,253
- References
- 82
- FWCI
- 156.64
- 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.