ArticlePDF Available
A preview of the PDF is not available
ResearchGate has not been able to resolve any citations for this publication.
Chapter
Simulated annealing is a general approach for approximately solving large combinatorial optimization problems. In this paper we first give a mathematical description of the algorithm and discuss its behaviour from both a theoretical and a practical point of view. We illustrate the practical use of the algorithm by discussing the application to a number of combinatorial optimization problems. In addition, we cite applications in such diverse areas as design of integrated circuits, image processing, code design and neural network theory, and discuss computational experience with the algorithm.