Skip to main content

Part of the book series: Mathematics and Its Applications ((MAIA,volume 37))

  • 2369 Accesses

Abstract

In this monograph we have presented a review of the theory and applications of simulated annealing. The simulated annealing algorithm is formulated using the theory of Markov chains and the convergence of the algorithm is analysed within this scope.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

van Laarhoven, P.J.M., Aarts, E.H.L. (1987). Summary and conclusions. In: Simulated Annealing: Theory and Applications. Mathematics and Its Applications, vol 37. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7744-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-7744-1_9

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-8438-5

  • Online ISBN: 978-94-015-7744-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics