Simulated Annealing is a probabilistic method for approximating the global optimum of a given function. It is helpful especially in the case of large search space.
- Make use of randomness, random walk on a search graph.
- Transition probabilities..
- Higher probability of accepting worse solutions in the begining (high temperature).