The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Convergence and finite-time behavior of simulated annealing
Abstract
Simulated annealing is a randomized algorithm which has been proposed for finding globally optimum least-cost configurations in large NP-complete problems with cost functions which may have many local minima. A theoretical analysis of simulated annealing based on its precise model, a time-inhomogeneous Markov chain, is presented. An annealing schedule is given for which the Markov chain is strongly ergodic and the algorithm converges to a global optimum. The finite-time behavior of simulated annealing is also analyzed and a bound obtained on the departure of the probability distribution of the state at finite time from the optimum. This bound gives an estimate of the rate of convergence and insights into the conditions on the annealing schedule which gives optimum performance.
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
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
(1979) · Cited by 43,841
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Monte Carlo Methods in Statistical Physics
(1979) · Topics in Current Physics · doi:10.1007/978-3-642-96483-1 · Cited by 1,219
Monte Carlo Methods in Statistical Physics
(1986) · Topics in Current Physics · doi:10.1007/978-3-642-82803-4 · Cited by 1,058
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
GEMAN, S., & GEMAN, D. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50057-x · Cited by 750
Reversibility and stochastic networks
Kingmán, J. F. C. (1980) · European Journal of Operational Research · doi:10.1016/0377-2217(80)90150-2 · Cited by 547
The TimberWolf placement and routing package
Sechen, C., & Sangiovanni-Vincentelli, A. (1985) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1985.1052337 · Cited by 532
Self-citationMarkov Chains -- Theory and Applications
Unwin, A., Isaacson, D. L., & Madsen, R. W. (1977) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008804 · Cited by 478
Nonstationary Markov chains and convergence of the annealing algorithm
Gidas, B. (1985) · Journal of Statistical Physics · doi:10.1007/bf01007975 · Cited by 248
Global Wiring by Simulated Annealing
Vecchi, M. P., & Kirkpatrick, S. (1983) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1983.1270039 · Cited by 240
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
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Global Optimization Methods in Geophysical Inversion
Sen, M. K., & Stoffa, P. L. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9780511997570 · Cited by 990
Simulated annealing: A tool for operational research
Eglese, R. W. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90001-r · Cited by 801
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metadata
- Authors
- Mitra, D., Romeo, F., & Sangiovanni-Vincentelli, A.
- Venue
- Advances in Applied Probability
- Publisher
- Cambridge University Press (CUP)
- Published
- 1986-09
- Volume
- 18
- Issue
- 3
- Pages
- 747-771
- ISSN
- 0001-8678 (ISSN-L)
- 1475-6064
- OpenAlex
- W2326740504
- Cited by
- 358
- References
- 15
- FWCI
- 10.73
- 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.