Simulated annealing
Also known as SA. This is the canonical page; those names redirect here.
Pairings in the atlas
- Geometric cooling schedulecanonTraveling-salesman toursfull lesson ▸metaheuristics
- Linear cooling schedulestandardDiscrete optimizationmetaheuristics
- Logarithmic cooling schedulespecialistConvergence-guaranteed annealingmetaheuristics
- Adaptive reheatingspecialistRestart-friendly annealingmetaheuristics
- Lundy-Mees schedulespecialistDiscrete optimizationmetaheuristics
Rivals: other methods for the same problems
- 2-opt
- 3-opt
- Adaptive large neighborhood search
- Ant Colony System
- Bitmask DP
- Branch and bound
- Christofides
- Concorde branch and cut
- Double-tree TSP
- Genetic algorithm
- Great deluge algorithm
- Greedy edge tour
- Guided local search
- Held-Karp
- Held-Karp lower bound
- Hill climbing
- Iterated local search
- Large neighborhood search
- Late acceptance hill climbing
- Lin-Kernighan
- Lin-Kernighan-Helsgaun
- Nearest neighbor tour
- Or-opt
- Record-to-record travel