Simulated Annealing
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
A stochastic optimization algorithm inspired by metal annealing, which accepts inferior solutions with a controlled probability to escape local optima, eventually converging to the global optimum.
SCAFFOLDING EFFECT
Reduce cognitive load
Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space for an optimization problem. For large numbers of local optima, SA can find the global optimu…
Anchor fast decisions
Using metal annealing as a metaphor: at high temperatures, the probability of accepting inferior solutions is high (according to exp(-ΔE/T)), facilitating escape from local optima; as the 'temperature' T decreases, the acceptance probability of inferior solutions decreases, gradually converging. The Metropolis criterion controls the acceptance probability.
MINIMUM ACTION
In progress 0/4Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Simulated_annealingverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS