1,359
edits
Changes
Jump to navigation
Jump to search
Line 3:
Line 3: − + + − +
Temperature Scheduling in Simulated Annealing (view source)
Revision as of 18:20, 20 December 2007
, 18:20, 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 and difficulty of ''terrain'' 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.
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 ''terrain'' 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 to Temperature Scheduling ==
Temperature scheduling in simulated annealing refers to the process of controlling the ''temperature'' in a particular run through either geometric or adaptive means. The effect that temperature has on an annealing run is that it determines the probability that a solution with a higher cost function value will be accepted over one with a lower value, which is known as ''hill climbing''. There are two main stages of temperature scheduling(warming up and cooling down), which are punctuated by two stopping conditions (equilibrium and frozen criterion respectively). The warming up stage represents a time in the
==Cooling Schedule Information==
==ParSA Scheduling Capabilities==
==Difficulty of the problem==
==Difficulty of the problem==