Skip to main content

Thermo-Inspired Machine Learning Algorithm: Simulated Annealing

  • Chapter
  • First Online:
Machine Learning for Model Order Reduction
  • 2063 Accesses

Abstract

Simulated Annealing (SA) is a global optimization algorithm. It belongs to the stochastic optimization algorithms. The idea of SA was published in a paper by Metropolis [1], this idea was inspired by the annealing process in metallurgy. In this process, a material is heated to a very high temperature so that the particles of the material are freely moving, and then the material is gradually cooled under certain conditions so that the particles begin to take the narrower paths till they collectively reach the minimum energy state level in the material as depicted in Fig. 3.1. In other words, it is a physical phenomenon that occurs when the metal is heated at a very high temperature, and then slowly cooled [2–9]. By analogy with this physical process, each step of the SA algorithm attempts to replace the current solution by a random solution till the desired output is obtained. At each step of the algorithm, SA decides between moving the system to a new state and staying in the current state. This decision is done probabilistically. The analogy between simulated annealing and physical system can be shown in Table 3.1.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.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

References

  1. N. Metropolis, W. Arianna, M. Rosenbluth, H. Augusta, Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087 (1953)

    Article  Google Scholar 

  2. S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. V. Černý, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41–51 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. S. Geman, D. Geman, Stochastic relaxation, Gibbs' distribution and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6, 721–741 (1984)

    Article  MATH  Google Scholar 

  5. B. Gidas, Nonstationary Markov chains and convergence of the annealing algorithm. J. Statist. Phys. 39, 73–131 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. R.A. Holley, S. Kusuoka, D.W. Stroock, Astmptotics of the spectral gap with applications to theory of simulated annealing. J. Funct. Anal. 83, 333–347 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. G.C. Jeng, J.W. Woods, Simulated annealing in compound Gaussian random fields. IEEE Trans. Inform. Theory 36, 94–107 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kuchner, H. J.. Asymptotic global behavior for stochastic approximations and diffusions with slowly decreasing noise effects: global minimization via Monte Carlo. Technical Report LCDS 85–7, Dept. Applied Mathematics, Brown Univ, (1985)

    Google Scholar 

  9. V. Granville and M. Krivanek and J–P. Rasson, Simulated annealing: a proof of convergence, IEEE Trans. Pattern Anal. Mach. Intell., (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Mohamed, K.S. (2018). Thermo-Inspired Machine Learning Algorithm: Simulated Annealing. In: Machine Learning for Model Order Reduction . Springer, Cham. https://doi.org/10.1007/978-3-319-75714-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75714-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75713-1

  • Online ISBN: 978-3-319-75714-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics