The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced.
Erscheinungsdatum: 06.10.2011

lgrsnf/A:\compressed\10.1007%2F978-1-4613-1627-5.pdf

nexusstc/The Annealing Algorithm/bc8f1b32429542a9bff88e37d39a73ca.pdf

zlib/Mathematics/R. H. J. M. Otten, L. P. P. P. van Ginneken (auth.)/The Annealing Algorithm_2111086.pdf

by R.H.J.M. Otten, L.P.P.P. Ginneken

The Kluwer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing -- 72, Kluwer international series in engineering and computer science -- 72., Boston, MA, Massachusetts, 1989

Softcover reprint of the original 1st ed. 1989, PS, 2011

United States, United States of America

Springer Nature, New York, NY, 2012

lg957187

{"container_title":"The Kluwer International Series in Engineering and Computer Science","edition":"1","isbns":["1461288991","1461316278","9781461288992","9781461316275"],"issns":["0893-3405"],"last_page":202,"publisher":"Springer US","series":"The Kluwer International Series in Engineering and Computer Science 72"}

Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.

Front Matter....Pages i-xi
The Annealing Algorithm: A Preview....Pages 1-20
Preliminaries from Matrix Theory....Pages 21-46
Chains....Pages 47-64
Chain Statistics....Pages 65-78
Annealing Chains....Pages 79-93
Samples from Normal Distributions....Pages 95-113
Score Densities....Pages 115-126
The Control Parameter....Pages 127-139
Finite-Time Behavior of the Annealing Algorithm....Pages 141-151
The Structure of the State Space....Pages 153-165
Implementation Aspects....Pages 167-177
Back Matter....Pages 179-201

2013-08-01