The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index.
The Theory and Practice of Simulated Annealing
Abstract
Simulated annealing is a popular local search meta-heuristic used to address discrete and, to a lesser extent, continuous optimization problems. The key feature of simulated annealing is that it provides a means to escape local optima by allowing hill-climbing moves (i.e., moves which worsen the objective function value) in hopes of finding a global optimum. A brief history of simulated annealing is presented, including a review of its application to discrete and continuous optimization problems. Convergence theory for simulated annealing is reviewed, as well as recent advances in the analysis of finite time performance. Other local search algorithms are discussed in terms of their relationship to simulated annealing. The chapter also presents practical guidelines for the implementation of simulated annealing in terms of cooling schedules, neighborhood functions, and appropriate applications.
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
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
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
Introduction to Probability Models.
Jolliffe, F., & Ross, S. M. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983433 · Cited by 4,525
Hammersley, J. M., & Handscomb, D. C. (1964) · Springer eBooks · doi:10.1007/978-94-009-5819-7 · Cited by 4,054
Ross, S. M. (1982) · Cited by 3,812
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Introduction to Stochastic Processes
(2014) · Stochastic Numerical Methods · doi:10.1002/9783527683147.ch6 · Cited by 2,383
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
Convergence analysis of canonical genetic algorithms
Rudolph, G. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265964 · Cited by 1,484
Introduction to Probability Models
RL, & Ross, S. M. (1998) · Journal of the American Statistical Association · doi:10.2307/2669658 · Cited by 1,482
Bratley, P., Fox, B. L., & Schrage, L. E. (1987) · Springer eBooks · doi:10.1007/978-1-4419-8724-2 · Cited by 1,468
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
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Introduction to Stochastic Processes.
Sen, P. K., & Cinlar, E. (1975) · Journal of the American Statistical Association · doi:10.2307/2285487 · Cited by 867
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Local Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 834
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
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Generalized Simulated Annealing for Function Optimization
Bohachevsky, I. O., Johnson, M. E., & Stein, M. L. (1986) · Technometrics · doi:10.1080/00401706.1986.10488128 · Cited by 573
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 546
Markov 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
Global optimization and simulated annealing
Dekkers, A., & Aarts, E. (1991) · Mathematical Programming · doi:10.1007/bf01594945 · Cited by 435
Schruben, L. W., Bratley, P., Fox, B. L., & Schrage, L. E. (1985) · Journal of the American Statistical Association · doi:10.2307/2287950 · Cited by 426
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
Statistical cooling : a general approach to combinatorial optimization problems
Aarts, E. E., & Laarhoven, V. P. P. (1985) · Philips Journal of Research · Cited by 366
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
Diffusions for Global Optimization
Geman, S., & Hwang, C.-R. (1986) · SIAM Journal on Control and Optimization · doi:10.1137/0324060 · Cited by 313
Ogbu, F. A., & Smith, D. K. (1990) · Computers & Operations Research · doi:10.1016/0305-0548(90)90001-n · Cited by 310
A comparison of simulated annealing cooling strategies
Nourani, Y., & Andresen, B. (1998) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/31/41/011 · Cited by 251
Enhanced simulated annealing for globally minimizing functions of many-continuous variables
Siarry, P., Berthiau, G., Durdin, F., & HAUSSY, J. (1997) · ACM Transactions on Mathematical Software · doi:10.1145/264029.264043 · Cited by 251
Nonstationary Markov chains and convergence of the annealing algorithm
Gidas, B. (1985) · Journal of Statistical Physics · doi:10.1007/bf01007975 · Cited by 248
Global optimization and stochastic differential equations
Aluffi-Pentini, F., Parisi, V., & Zirilli, F. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00941312 · Cited by 227
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Glover, F. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90211-9 · Cited by 218
Convergence Rates for Markov Chains
Rosenthal, J. S. (1995) · SIAM Review · doi:10.1137/1037083 · Cited by 187
Hit-and-Run Algorithms for Generating Multivariate Distributions
Bélisle, C. J. P., Romeijn, H. E., & Smith, R. L. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.2.255 · Cited by 186
A theoretical framework for simulated annealing
Romeo, F., & Sangiovanni-Vincentelli, A. (1991) · Algorithmica · doi:10.1007/bf01759049 · Cited by 173
Genetic algorithms: Foundations and applications
Liepins, G. E., & Hilliard, M. R. (1989) · Annals of Operations Research · doi:10.1007/bf02022092 · Cited by 165
The noising method: a new method for combinatorial optimization
Charon, I., & Hudry, O. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90023-a · Cited by 160
Simulated annealing methods with general acceptance probabilities
Anily, S., & Federgruen, A. (1987) · Journal of Applied Probability · doi:10.1017/s0021900200031387 · Cited by 146
Improving Hit-and-Run for global optimization
Zabinsky, Z. B., Smith, R. L., McDonald, J. F., Romeijn, H. E., & Kaufman, D. E. (1993) · Journal of Global Optimization · doi:10.1007/bf01096737 · Cited by 141
Simulated Annealing: Searching for an Optimal Temperature Schedule
Cohn, H., & Fielding, M. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497329683 · Cited by 132
A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm
Davis, T. E., & Príncipe, J. C. (1991) · international conference on Genetic algorithms · Cited by 122
Parallel Simulated Annealing by Mixing of States
Chu, K.-W., Deng, Y., & Reinitz, J. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1998.6134 · Cited by 102
On the convergence of ?Threshold Accepting?
Althfer, I., & Koschnick, K.-U. (1991) · Applied Mathematics & Optimization · doi:10.1007/bf01447741 · Cited by 95
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
Hu, T. C., Kahng, A. B., & Tsao, C.-W. A. (1995) · INFORMS journal on computing · doi:10.1287/ijoc.7.4.417 · Cited by 78
Moscato, P. (1993) · Annals of Operations Research · doi:10.1007/bf02022564 · Cited by 77
Simulated annealing using the classical density distribution
Ma, J., & Straub, J. E. (1994) · The Journal of Chemical Physics · doi:10.1063/1.468163 · Cited by 63
A Limit Theorem for a Class of Inhomogeneous Markov Processes
Chiang, T.-S., & Chow, Y. (1989) · The Annals of Probability · doi:10.1214/aop/1176991169 · Cited by 60
Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
Chardaire, P., Lutton, J. L., & Sutter, A. (1995) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00058-k · Cited by 37
Finite-Time Performance Analysis of Static Simulated Annealing Algorithms
Orosz, J. E., & Jacobson, S. H. (2002) · Computational Optimization and Applications · doi:10.1023/a:1013544329096 · Cited by 21
Self-citationOrdinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems
Sullivan, K. A., & Jacobson, S. H. (2000) · Discrete Event Dynamic Systems · doi:10.1023/a:1008302003857 · Cited by 19
Self-citationSome results characterizing the finite time behaviour of the simulated annealing algorithm
Desai, M. P. (1999) · Sadhana · doi:10.1007/bf02823146 · Cited by 11
Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms
Jacobson, S. H. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_20 · Cited by 10
Self-citation
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
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
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E., & Pape, C. L. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0518-7 · Cited by 530
Quantum optimization of maximum independent set using Rydberg atom arrays
Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science · doi:10.1126/science.abo6587 · Cited by 430
A review on optimization methods applied in energy-efficient building geometry and envelope design
Kheiri, F. (2018) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2018.04.080 · Cited by 400
Metadata
- Authors
- Henderson, D., Jacobson, S. H., & Johnson, A. W.
- Venue
- International Series in Operations Research & Management Science
- Publisher
- Kluwer Academic Publishers
- Published
- 2006-02-02
- Pages
- 287-319
- OpenAlex
- W2210692376
- Cited by
- 514
- References
- 62
- FWCI
- 19.05
- Type
- book chapter
- 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.