The Annealing Algorithm

  • R. H. J. M. Otten
  • L. P. P. P. van Ginneken

Table of contents

  1. Front Matter
    Pages i-xi
  2. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 1-20
  3. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 21-46
  4. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 47-64
  5. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 65-78
  6. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 79-93
  7. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 95-113
  8. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 115-126
  9. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 127-139
  10. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 141-151
  11. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 153-165
  12. R. H. J. M. Otten, L. P. P. P. van Ginneken
    Pages 167-177
  13. Back Matter
    Pages 179-201

About this book

Introduction

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.

Keywords

Mathematica algorithms analog combinatorial optimization model optimization quality statistics

Authors and affiliations

  • R. H. J. M. Otten
    • 1
  • L. P. P. P. van Ginneken
    • 2
  1. 1.Delft University of TechnologyThe Netherlands
  2. 2.Eindhoven University of TechnologyThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4613-1627-5
  • Copyright Information Springer-Verlag US 1989
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8899-2
  • Online ISBN 978-1-4613-1627-5
  • Series Print ISSN 0893-3405
  • About this book