The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Record Breaking Optimization Results Using the Ruin and Recreate Principle
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
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
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
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
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
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
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Self-citationA 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
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
Monte Carlo Simulation in Statistical Physics: An Introduction
Binder, K., & Heermann, D. W. (2019) · Graduate Texts in Physics · doi:10.1007/978-3-030-10758-1 · Cited by 879
Cited by
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
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
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
Partial recharge strategies for the electric vehicle routing problem with time windows
Keskin, M., & Çatay, B. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.01.013 · Cited by 600
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Metadata
- Authors
- Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2000-04
- Volume
- 159
- Issue
- 2
- Pages
- 139-171
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2162423772
- Cited by
- 413
- References
- 15
- FWCI
- 2.50
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Record Breaking Optimization Results Using the Ruin and Recreate Principle. https://app.cochat.ai/papers/10.1006/jcph.1999.6413
- The paper
- Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record Breaking Optimization Results Using the Ruin and Recreate Principle. Journal of Computational Physics. https://doi.org/10.1006/jcph.1999.6413
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.