The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A comparison of simulated annealing cooling strategies
Open accessAbstract
Using computer experiments on a simple three-state system and an NP-complete system of permanents we compare different proposed simulated annealing schedules in order to find the cooling strategy which has the least total entropy production during the annealing process for given initial and final states and fixed number of iterations. The schedules considered are constant thermodynamic speed, exponential, logarithmic, and linear cooling schedules. The constant thermodynamic speed schedule is shown to be the best. We are actually considering two different schedules with constant thermodynamic speed, the original one valid for near-equilibrium processes, and a version based on the natural timescale valid also at higher speeds. The latter one delivers better results, especially in case of fast cooling or when the system is far from equilibrium. Also with the lowest energy encountered during the entire optimization (the best-so-far-energy) as the indicator of merit, constant thermodynamic speed is superior. Finally, we have compared two different estimators of the relaxation time. One estimator is using the second largest eigenvalue of the thermalized form of the transition probability matrix and the other is using a simpler approximation for small deviations from equilibrium. These two different expressions only agree at high temperatures.
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
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Cited by
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Fuzzy communities and the concept of bridgeness in complex networks
Nepusz, T., Petróczi, A., Négyessy, L., & Bazsó, F. (2008) · Physical Review E · doi:10.1103/physreve.77.016107 · Cited by 421
Metaheuristics: review and application
Gogna, A., & Tayal, A. (2013) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/0952813x.2013.782347 · Cited by 355
Meta-learning of Sequential Strategies
Ortega, P. A., Wang, J. X., Rowland, M., Genewein, T., Kurth-Nelson, Z., Pascanu, R., Heess, N., Veness, J., Pritzel, A., Sprechmann, P., et al. (2019) · arXiv · doi:10.48550/arxiv.1905.03030 · Cited by 47
Metadata
- Authors
- Nourani, Y., & Andresen, B.
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 1998-10-16
- Volume
- 31
- Issue
- 41
- Pages
- 8373-8385
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W1986342384
- Cited by
- 251
- References
- 1
- FWCI
- 0.88
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A comparison of simulated annealing cooling strategies. https://app.cochat.ai/papers/10.1088/0305-4470/31/41/011
- The paper
- Nourani, Y., & Andresen, B. (1998). A comparison of simulated annealing cooling strategies. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/31/41/011
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.