Simulated annealing¶
Kirkpatrick, S., Gelatt, C. D. ,. J., & Vecchi, M. P. (1983). Simulated annealing.
Retired. This entry was not a citation. Our extractor stored an inline prose definition from the article as though it were a bibliographic record: the title names a concept rather than a published work, and the citation text names no work at all. The page is kept because links to it still resolve, but it is withdrawn from the reference list. This entry is kept so the citations that pointed at it still resolve, and so the correction is visible rather than silent.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Annealing, Noise, or Random Restart
- When the landscape is unknown and the current state is merely the best nearby, exploration is the only way forward.
This sourceCited as the real algorithm this mechanism generalizes, without asserting any specific performance figure.
- When the landscape is unknown and the current state is merely the best nearby, exploration is the only way forward.
- Annealing Temperature Schedule
- The team's real work was choosing that curve — hot enough at the start to escape traps, slow enough to cool that good structure survives — because on a badly-set schedule the same solver either freezes into the first mediocre loop or never settles at all.
This sourceAccepting occasional worsening moves with a temperature-dependent probability is the Metropolis criterion that makes the escape-from-local-optima behavior work.
- The team's real work was choosing that curve — hot enough at the start to escape traps, slow enough to cool that good structure survives — because on a badly-set schedule the same solver either freezes into the first mediocre loop or never settles at all.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:68330b9b0d77 · see in the full table