The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Abstract
This paper surveys the research on the metaheuristics for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval; all routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. Metaheuristics are general solution procedures that explore the solution space to identify good solutions and often embed some of the standard route construction and improvement heuristics described in the first part of this article. In addition to describing basic features of each method, experimental results for Solomon’s benchmark test problems are presented and analyzed.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
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
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
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
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
Self-Organization and Associative Memory
Kohonen, T. (1988) · Springer Series in Information Sciences · doi:10.1007/978-3-662-00784-6 · Cited by 3,812
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Evolutionary computation: Toward a new philosophy of machine intelligence
B�ck, T. (1997) · Complexity · doi:10.1002/(sici)1099-0526(199703/04)2:4<28::aid-cplx7>3.0.co;2-2 · Cited by 1,533
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
A Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Gillett, B. E., & Miller, L. R. (1974) · Operations Research · doi:10.1287/opre.22.2.340 · Cited by 1,179
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0056 · Cited by 1,135
Self-citationA 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
Probabilistic diversification and intensification in local search for vehicle routing
Rochat, Y., & Taillard, É. D. (1995) · Journal of Heuristics · doi:10.1007/bf02430370 · Cited by 914
A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601163 · Cited by 897
Local Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 834
Lau, H. T. (1986) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-61649-5_4 · Cited by 796
Schwefel, H.-P. (1977) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-5927-1 · Cited by 729
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
Gambardella, L. M., Taillard, É. D., & Agazzi, G. (1999) · Cited by 725
Performance of various computers using standard linear equations software
Dongarra, J. J. (1992) · ACM SIGARCH Computer Architecture News · doi:10.1145/141868.141871 · Cited by 708
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1992) · Operations Research · doi:10.1287/opre.40.6.1086 · Cited by 521
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Bent, R., & Van Hentenryck, P. (2004) · Transportation Science · doi:10.1287/trsc.1030.0049 · Cited by 355
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Heuristic methods for vehicle routing problem with time windows
Tan, K. C., Lee, L. H., Zhu, Q. L., & Ou, K. (2001) · Artificial Intelligence in Engineering · doi:10.1016/s0954-1810(01)00005-x · Cited by 310
Vehicle routing problem with time windows and a limited number of vehicles
Lau, H. C., Sim, M., & Teo, K. M. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00363-6 · Cited by 274
An Introduction to Tabu Search
Michel Gendreau, A. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_2 · Cited by 256
Voudouris, C., Tsang, E. P. K., & Alsheddy, A. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_11 · Cited by 215
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms
Blanton, J. L., & Wainwright, R. L. (1993) · international conference on Genetic algorithms · Cited by 212
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Bouthillier, A. L., & Crainic, T. G. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.023 · Cited by 194
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Backer, B. D., Furnon, V., Shaw, P., Kilby, P., & Prosser, P. (2000) · Journal of Heuristics · doi:10.1023/a:1009621410177 · Cited by 183
Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows
Gehring, H., & Homberger, J. (2002) · Journal of Heuristics · doi:10.1023/a:1015053600842 · Cited by 131
Anderson, D., Anderson, E. H., Lesh, N. B., Marks, J., Perlin, K., Ratajczak, D., & Ryall, K. (1999) · doi:10.1145/331770.331778 · Cited by 131
Local search with annealing-like restarts to solve the VRPTW
Li, H., & Lim, A. E. B. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00486-1 · Cited by 128
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows
Br�ysy, O., Dullaert, W. E. H., & Michel Gendreau, A. (2004) · Journal of Heuristics · doi:10.1007/s10732-005-5431-6 · Cited by 127
Self-citationA Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
Berger, J., Barkaoui, M., & Bräysy, O. (2003) · INFOR Information Systems and Operational Research · doi:10.1080/03155986.2003.11732675 · Cited by 119
Self-citationA parallel algorithm for the vehicle routing problem with time window constraints
Schulze, J., & Fahle, T. (1999) · Annals of Operations Research · doi:10.1023/a:1018948011707 · Cited by 105
Artificial intelligence heuristics in solving vehicle routing problems with time window constraints
Tan, K. C., Lee, L. H., & Ou, K. (2001) · Engineering Applications of Artificial Intelligence · doi:10.1016/s0952-1976(02)00011-8 · Cited by 104
A hybrid approach to vehicle routing using neural networks and genetic algorithms
Potvin, J., Dub�, D., & Robillard, C. (1996) · Applied Intelligence · doi:10.1007/bf00126629 · Cited by 64
An Indexed Bibliography of Genetic Algorithms
Alander, J. T. (1995) · CRC Press eBooks · doi:10.1201/9781420050073.ax1 · Cited by 58
Clustering for vehicle routing with a competitive neural network
Potvin, J., & Robillard, C. (1995) · Neurocomputing · doi:10.1016/0925-2312(94)00012-h · Cited by 32
Cited by
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Self-citationHandbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
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
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012) · Operations Research · doi:10.1287/opre.1120.1048 · Cited by 709
Self-citation
Metadata
- Authors
- Bräysy, O., & Gendreau, M.
- Venue
- Transportation Science
- Published
- 2005-02
- Volume
- 39
- Issue
- 1
- Pages
- 119-139
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2116675171
- Cited by
- 844
- References
- 56
- FWCI
- 127.31
- Type
- journal article
- Language
- en
- Open access
- closed
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.