Abstract
The goal of the annealing algorithm is to find a state s with ε(s) close to ε(s0). The chain would be almost all the time in such a state after reaching equilibrium for a very low value of the control parameter t, but it would take a huge number of steps to reach and detect that situation. For very high values of t the chain will be almost immediately in equilibrium. Also to reestablish equilibrium from an equilibrium situation at a slightly different t can be done in relatively few steps, because changes in the equilibrium density can be made arbitrarily small by keeping the changes in t small enough. The algorithm therefore performs the annealing chain for several in general decreasing, values of t, each time of course with a limited number of steps, and thereby reducing the space accessibility by confining the chain more and more to states hopefully close to a global minimum. The decrements in t and the number of steps per value of t are the parameters that characterize the schedule.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Otten, R.H.J.M., van Ginneken, L.P.P.P. (1989). The Control Parameter. In: The Annealing Algorithm. The Kluwer International Series in Engineering and Computer Science, vol 72. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1627-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1627-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8899-2
Online ISBN: 978-1-4613-1627-5
eBook Packages: Springer Book Archive