The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Cooling Schedules for Optimal Annealing
Abstract
A Monte Carlo optimization technique called “simulated annealing” is a descent algorithm modified by random ascent moves in order to escape local minima which are not global minima. The level of randomization is determined by a control parameter T, called temperature, which tends to zero according to a deterministic “cooling schedule.” We give a simple necessary and sufficient condition on the cooling schedule for the algorithm state to converge in probability to the set of globally minimum cost states. In the special case that the cooling schedule has parametric form T(t) = c/log(1 + t), the condition for convergence is that c be greater than or equal to the depth, suitably defined, of the deepest local minimum which is not a global minimum state.
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
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 · cited 1×
“(2) Some information on how quickly convergence occurs in Equation (1.5) can be gleaned from Theorems 3 and 4 in § §3 and 4 respectively, and from the proofs in [2] [3] [4].”
BackgroundInfluentialThermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Diffusions for Global Optimization
Geman, S., & Hwang, C.-R. (1986) · SIAM Journal on Control and Optimization · doi:10.1137/0324060 · Cited by 313
Nonstationary Markov chains and convergence of the annealing algorithm
Gidas, B. (1985) · Journal of Statistical Physics · doi:10.1007/bf01007975 · Cited by 248
Cited by
Haupt, R. L., & Haupt, S. E. (2003) · Wiley eBooks · doi:10.1002/0471671746 · Cited by 4,246
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
Learning in Artificial Neural Networks: A Statistical Perspective
White, H. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.425 · Cited by 922
MONTE CARLO METHODS IN GEOPHYSICAL INVERSE PROBLEMS
Sambridge, M., & Mosegaard, K. (2002) · Reviews of Geophysics · doi:10.1029/2000rg000089 · Cited by 829
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
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
A survey on metaheuristics for stochastic combinatorial optimization
Bianchi, L., Dorigo, M., Gambardella, L. M., & Gutjahr, W. J. (2009) · Natural Computing · doi:10.1007/s11047-008-9098-4 · Cited by 737
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Lévy flights, non-local search and simulated annealing
Pavlyukevich, I. (2007) · Journal of Computational Physics · doi:10.1016/j.jcp.2007.06.008 · Cited by 672
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Jiang, L., & Walrand, J. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2035046 · Cited by 635
Simulated annealing for permutation flow-shop scheduling
Osman, I., & Potts, C. (1989) · Omega · doi:10.1016/0305-0483(89)90059-5 · Cited by 614
A survey of simulated annealing as a tool for single and multiobjective optimization
Suman, B., & Kumar, P. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602068 · Cited by 611
Representations of Knowledge in Complex Systems
Grenander, U., & Miller, M. I. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb02000.x · Cited by 603
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
Schmitt, L. M. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00406-0 · Cited by 512
Minimization of $\ell_{1-2}$ for Compressed Sensing
Yin, P., Lou, Y., He, Q., & Xin, J. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140952363 · Cited by 473
Simulation optimization: a review of algorithms and applications
Amaran, S., Sahinidis, N. V., Sharda, B., & Bury, S. J. (2016) · Annals of Operations Research · doi:10.1007/s10479-015-2019-x · Cited by 467
A short convergence proof for a class of ant colony optimization algorithms
Stutzle, T., & Dorigo, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802444 · Cited by 427
Maniezzo, V., Gambardella, L. M., & de Luigi, F. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_5 · Cited by 403
Simulated annealing: a proof of convergence
Granville, V., Krivanek, M., & Rasson, J.-P. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.295910 · Cited by 368
Convergence and finite-time behavior of simulated annealing
Mitra, D., Romeo, F., & Sangiovanni-Vincentelli, A. (1986) · Advances in Applied Probability · doi:10.2307/1427186 · Cited by 358
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Williams, R. D. (1991) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330030502 · Cited by 345
Systems biology: parameter estimation for biochemical models
Ashyraliyev, M., Fomekong‐Nanfack, Y., Kaandorp, J. A., & Blom, J. G. (2009) · The FEBS Journal · doi:10.1111/j.1742-4658.2008.06844.x · Cited by 323
Parallel recombinative simulated annealing: A genetic algorithm
Mahfoud, S. W., & Goldberg, D. E. (1995) · Parallel Computing · doi:10.1016/0167-8191(94)00071-h · Cited by 320
VLSI cell placement techniques
Shahookar, K., & Mazumder, P. (1991) · ACM Computing Surveys · doi:10.1145/103724.103725 · Cited by 308
Schön, J. C., & Jansen, M. (1996) · Angewandte Chemie International Edition in English · doi:10.1002/anie.199612861 · Cited by 302
Demand Response Management via Real-Time Electricity Price Control in Smart Grids
Qian, L. P., Zhang, Y. J. A., Huang, J., & Wu, Y. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130710 · Cited by 287
An effective hybrid optimization strategy for job-shop scheduling problems
Wang, L., & Zheng, D.-Z. (2001) · Computers & Operations Research · doi:10.1016/s0305-0548(99)00137-9 · Cited by 277
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
Simulation optimization: A comprehensive review on theory and applications
TEKIN, E., & SABUNCUOGLU, I. (2004) · IIE Transactions · doi:10.1080/07408170490500654 · Cited by 265
Cohen, I., Sebe, N., Gozman, F. G., Cirelo, M. C., & Huang, T. S. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211408 · Cited by 155
Data-driven enhanced sampling of mechanistic pathways
Elangovan, R., Chatterjee, S., & Ray, D. (2025) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2517169122 · Cited by 3
Metadata
- Authors
- Hajek, B.
- Venue
- Mathematics of Operations Research
- Published
- 1988-05
- Volume
- 13
- Issue
- 2
- Pages
- 311-329
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2005228957
- Cited by
- 1,246
- References
- 5
- FWCI
- 28.99
- 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.