1,359
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: +
Temperature Scheduling in Simulated Annealing (view source)
Revision as of 08:18, 20 December 2007
, 08:18, 20 December 2007no edit summary
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 of the search space have connections to the convergence properties of ones algorithm. These topics are also 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.
== Introduction ==
== Introduction ==