27 Jan 2005
CS 3243 - Heuristics
37
Properties
of simulated annealing search
nOne can prove: If T decreases slowly enough, then simulated annealing search will find
a global optimum
with probability approaching 1
nWidely
used in VLSI layout, airline scheduling, etc