Changes

The purpose of this page is to describe the notion of temperature scheduling in simulated annealing.  The type of temperature schedule used in one's algorithm and the size and difficulty of the ''terrain'' of the search space have connections to the convergence properties of the algorithm.  These topics are considered briefly below, with an emphasis on ''the diamond problem''.  Additionally, prospective temperature scheduling strategies are also proposed, which will serve as a backbone to potential simulated annealing runs in the near future.   

The purpose of this page is to describe the notion of temperature scheduling in simulated annealing.  The type of temperature schedule used in one's algorithm and the size and difficulty of the ''terrain'' of the search space have connections to the convergence properties of the algorithm.  These topics are considered briefly below, with an emphasis on ''the diamond problem''.  Additionally, prospective temperature scheduling strategies are also proposed, which will be studied in actual simulated annealing runs in the near future.   

== Introduction to Temperature Scheduling ==

== Introduction to Temperature Scheduling ==