Definition
A probabilistic optimization technique inspired by the annealing process in metallurgy that gradually decreases the probability of accepting worse solutions.
Detailed Explanation
Simulated annealing starts with a high 'temperature' that allows frequent acceptance of worse solutions, enabling broad exploration of the search space. The temperature is gradually decreased according to a cooling schedule, making the algorithm more selective in accepting worse solutions over time. This helps escape local optima while eventually converging to a good solution.
Use Cases
Combinatorial optimization, Parameter tuning, Layout optimization