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.
Unable to display preview. Download preview PDF.