Simulated annealing is a probabilistic optimization technique for approximating a global optimum in a large search space. It allows occasional moves to worse solutions early in the search to reduce the chance of becoming trapped in poor local optima.
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.