The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
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
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
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
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
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
Cited by
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
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
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Khishe, M., & Mosavi, M. R. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113338 · Cited by 1,229
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
A genetic algorithm for the vehicle routing problem
Baker, B. M., & Ayechew, M. A. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00051-5 · Cited by 883
Classical and modern heuristics for the vehicle routing problem
Laporte, G. (2000) · International Transactions in Operational Research · doi:10.1016/s0969-6016(00)00003-4 · Cited by 759
Ant colony optimization techniques for the vehicle routing problem
Bell, J. E., & McMullen, P. R. (2004) · Advanced Engineering Informatics · doi:10.1016/j.aei.2004.07.001 · Cited by 712
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Self-citationAn improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Applying the ANT System to the Vehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_20 · Cited by 408
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M., Doerner, K., & Hartl, R. F. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00014-5 · Cited by 387
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
Kuo, Y. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2010.03.012 · Cited by 343
Analysis of Travel Times and CO 2 Emissions in Time‐Dependent Vehicle Routing
Jabali, O., VanWoensel, T., & de Kok, A. G. (2012) · Production and Operations Management · doi:10.1111/j.1937-5956.2012.01338.x · Cited by 332
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
A Review of the Existing and Emerging Topics in the Supply Chain Risk Management Literature
Pournader, M., Kach, A., & Talluri, S. (. (2020) · Decision Sciences · doi:10.1111/deci.12470 · Cited by 306
Heuristics from nature for hard combinatorial optimization problems
Colorni, A. (1996) · International Transactions in Operational Research · doi:10.1016/0969-6016(96)00004-4 · Cited by 288
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
Self-citationVehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods
El-Sherbeny, N. A. (2010) · Journal of King Saud University - Science · doi:10.1016/j.jksus.2010.03.002 · Cited by 257
Metadata
- Authors
- Osman, I. H.
- Venue
- Annals of Operations Research
- Published
- 1993-12
- Volume
- 41
- Issue
- 4
- Pages
- 421-451
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2007401074
- Cited by
- 1,046
- References
- 23
- FWCI
- 87.46
- 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.