Simulated annealing is a new technique for solving combinatorial optimizations problems. It was first proposed in the early 1980's and originally based on the analogy between the simulation of solids and the problem of solving large combinatorial optimization problems. This book is the first extensive survey of the theory and applications of simulated annealing. It provides an in-depth analysis of the theoretical aspects of the technique, based on concepts from the theory of Markov chains. Computational experience with simulated annealing is extensively discussed and applications are presented for a large number of combinatorial optimization problems in computer-aided circuit design. Applications in other areas re briefly described.

`Simulated annealing is an optimization technique that should be included in everyone's bag of computing tricks'
SIAM News (September 1986)

Inhalt
1 Introduction.- 2 Simulated annealing.- 3 Asymptotic convergence results.- 4 The relation with statistical physics.- 5 Towards implementing the algorithm.- 6 Performance of the simulated annealing algorithm.- 7 Applications.- 8 Some miscellaneous topics.- 9 Summary and conclusions.