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
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 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 generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
Simulated annealing for permutation flow-shop scheduling
Osman, I., & Potts, C. (1989) · Omega · doi:10.1016/0305-0483(89)90059-5 · Cited by 614
Self-citationShekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Bounds and Heuristics for Capacitated Routing Problems
Haimovich, M., & Kan, A. H. G. R. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.4.527 · Cited by 363
State‐space relaxation procedures for the computation of bounds to routing problems
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Networks · doi:10.1002/net.3230110207 · Cited by 330
Exact Algorithms for the Vehicle Routing Problem
Gilbert Laporte, A., & Nobert, Y. (1987) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73235-3 · Cited by 318
Optimal Routing under Capacity and Distance Restrictions
Laporte, G., Nobert, Y., & Desrochers, M. (1985) · Operations Research · doi:10.1287/opre.33.5.1050 · Cited by 307
Twenty Years of Routing and Scheduling
Bodin, L. D. (1990) · Operations Research · doi:10.1287/opre.38.4.571 · Cited by 108
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
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
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
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
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.
