The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods
Open accessAbstract
In this paper, we present a review with some limited of exacts, heuristics and metaheuristics methods for the vehicle routing problem time windows (VRPTW). Over the past 20 years vehicle routing problem with time windows has been an area of research that has attracted many researchers. In this period a number of papers have been published on the exact, heuristics and metaheursitics methods of the routing problem with time windows. This problem has model character in many branches of mathematics, computer science, and operations research. Metaheuristics support managers in decision-making with robust that provide high-quality solutions to important applications in business, engineering, economic and science in reasonable time horizons.
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
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Glover, F., & Laguna, M. (1997) · Cited by 5,679
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
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
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Complexity of vehicle routing and scheduling problems
Lenstra, J. K., & Kan, A. H. G. R. (1981) · Networks · doi:10.1002/net.3230110211 · Cited by 1,325
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
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
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
The pickup and delivery problem with time windows
Dumas, Y., Desrosiers, J., & Soumis, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90319-q · Cited by 667
Fleet Management and Logistics
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5 · Cited by 485
Routing with time windows by column generation
Desrosiers, J., Soumis, F., & Desrochers, M. (1984) · Networks · doi:10.1002/net.3230140406 · Cited by 366
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
Genetic algorithms and tabu search: Hybrids for optimization
Glover, F., Kelly, J. P., & Laguna, M. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0023-m · Cited by 306
Vehicle Routing with Time Windows
Kolen, A. W. J., Kan, A. H. G. R., & Trienekens, H. W. J. M. (1987) · Operations Research · doi:10.1287/opre.35.2.266 · Cited by 304
Pirlot, M. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(96)00007-0 · Cited by 252
Fleet Management and Logistics.
Ittmann, H. W., Crainic, T. G., & Gilbert Laporte, A. (1999) · Journal of the Operational Research Society · doi:10.2307/3010639 · Cited by 221
Kohl, N., & Madsen, O. B. G. (1997) · Operations Research · doi:10.1287/opre.45.3.395 · Cited by 215
A 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
Cited by
A Coevolutionary Framework for Constrained Multiobjective Optimization Problems
Tian, Y., Zhang, T., Xiao, J., Zhang, X., & Jin, Y. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.3004012 · Cited by 735
Holland, C., Levis, J., Nuggehalli, R., Santilli, B., & Winters, J. (2017) · Interfaces · doi:10.1287/inte.2016.0875 · Cited by 95
Metadata
- Authors
- El-Sherbeny, N. A.
- Venue
- Journal of King Saud University - Science
- Publisher
- Scientific Scholar
- Published
- 2010-07
- Volume
- 22
- Issue
- 3
- Pages
- 123-131
- ISSN
- 1018-3647 (ISSN-L)
- OpenAlex
- W2040140158
- Cited by
- 257
- References
- 24
- FWCI
- 20.03
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.