Save today: Get 40% off titles in Popular Science!

The Springer International Series in Engineering and Computer Science

The Annealing Algorithm

Authors: Otten, R.H.J.M., van Ginneken, L.P.P.P.

Free Preview

Buy this book

eBook $189.00
price for USA in USD
  • ISBN 978-1-4613-1627-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $239.00
price for USA in USD
Softcover $239.00
price for USA in USD
About this book

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.

Reviews

`I highly recommend this book for colleagues versed in simulated annealing, particularly those who lean toward theory.'
D. Greening, Computer Reviews, June 1990

Table of contents (11 chapters)

Table of contents (11 chapters)

Buy this book

eBook $189.00
price for USA in USD
  • ISBN 978-1-4613-1627-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $239.00
price for USA in USD
Softcover $239.00
price for USA in USD
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
The Annealing Algorithm
Authors
Series Title
The Springer International Series in Engineering and Computer Science
Series Volume
72
Copyright
1989
Publisher
Springer US
Copyright Holder
Kluwer Academic Publishers
eBook ISBN
978-1-4613-1627-5
DOI
10.1007/978-1-4613-1627-5
Hardcover ISBN
978-0-7923-9022-0
Softcover ISBN
978-1-4612-8899-2
Series ISSN
0893-3405
Edition Number
1
Number of Pages
XII, 202
Topics