Implementation Aspects

  • R. H. J. M. Otten
  • L. P. P. P. van Ginneken
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 72)


So far this book described the annealing algorithm in general terms of states, moves and scores. For an implementation, these concepts have to be associated with concrete configurations, modifications and objective functions in such a way that they can be manipulated by a computer, i.e. written in a programming language. For many problems this task is relatively straightforward. The state space and the score function are usually strongly suggested by the problem specification. The move set should be chosen such that the modifications and new scores can be computed fast, and a smooth space landscape is realized.


Control Parameter Selection Function Score Function Acceptance Probability Implementation Aspect 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1989

Authors and Affiliations

  • R. H. J. M. Otten
    • 1
  • L. P. P. P. van Ginneken
    • 2
  1. 1.Delft University of TechnologyThe Netherlands
  2. 2.Eindhoven University of TechnologyThe Netherlands

Personalised recommendations