Skip to main content
Top

2016 | OriginalPaper | Chapter

2. Simulated Annealing

Authors : Ke-Lin Du, M. N. S. Swamy

Published in: Search and Optimization by Metaheuristics

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter is dedicated to simulated annealing (SA) metaheuristic for optimization. SA is a probabilistic single-solution-based search method inspired by the annealing process in metallurgy. Annealing is a physical process where a solid is slowly cooled until its structure is eventually frozen at a minimum energy configuration. Various SA variants are also introduced.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
Also known as the Boltzmann–Gibbs distribution.
 
Literature
1.
go back to reference Aarts E, Korst J. Simulated annealing and Boltzmann machines. Chichester: Wiley; 1989.MATH Aarts E, Korst J. Simulated annealing and Boltzmann machines. Chichester: Wiley; 1989.MATH
2.
go back to reference Andrieu A, de Freitas JFG, Doucet A. Robust full Bayesian learning for radial basis networks. Neural Comput. 2001;13:2359–407.CrossRefMATH Andrieu A, de Freitas JFG, Doucet A. Robust full Bayesian learning for radial basis networks. Neural Comput. 2001;13:2359–407.CrossRefMATH
3.
go back to reference Azencott R. Simulated annealing: parallelization techniques. New York: Wiley; 1992.MATH Azencott R. Simulated annealing: parallelization techniques. New York: Wiley; 1992.MATH
4.
go back to reference Cerny V. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl. 1985;45:41–51.MathSciNetCrossRefMATH Cerny V. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl. 1985;45:41–51.MathSciNetCrossRefMATH
5.
go back to reference Czech ZJ. Three parallel algorithms for simulated annealing. In: Proceedings of the 4th international conference on parallel processing and applied mathematics, Naczow, Poland. London: Springer; 2001. p. 210–217. Czech ZJ. Three parallel algorithms for simulated annealing. In: Proceedings of the 4th international conference on parallel processing and applied mathematics, Naczow, Poland. London: Springer; 2001. p. 210–217.
6.
go back to reference Geman S, Geman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell. 1984;6:721–41.CrossRefMATH Geman S, Geman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell. 1984;6:721–41.CrossRefMATH
7.
11.
go back to reference Liang F. Annealing stochastic approximation Monte Carlo algorithm for neural network training. Mach Learn. 2007;68:201–33.CrossRef Liang F. Annealing stochastic approximation Monte Carlo algorithm for neural network training. Mach Learn. 2007;68:201–33.CrossRef
13.
go back to reference Locatelli M. Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Math Methods Oper Res. 2001;54:171–99.MathSciNetCrossRefMATH Locatelli M. Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Math Methods Oper Res. 2001;54:171–99.MathSciNetCrossRefMATH
14.
go back to reference Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E. Equations of state calculations by fast computing machines. J Chem Phys. 1953;21(6):1087–92.CrossRef Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E. Equations of state calculations by fast computing machines. J Chem Phys. 1953;21(6):1087–92.CrossRef
15.
go back to reference Richardt J, Karl F, Muller C. Connections between fuzzy theory, simulated annealing, and convex duality. Fuzzy Sets Syst. 1998;96:307–34.MathSciNetCrossRef Richardt J, Karl F, Muller C. Connections between fuzzy theory, simulated annealing, and convex duality. Fuzzy Sets Syst. 1998;96:307–34.MathSciNetCrossRef
16.
go back to reference Rose K, Gurewitz E, Fox GC. A deterministic annealing approach to clustering. Pattern Recognit Lett. 1990;11(9):589–94.CrossRefMATH Rose K, Gurewitz E, Fox GC. A deterministic annealing approach to clustering. Pattern Recognit Lett. 1990;11(9):589–94.CrossRefMATH
17.
go back to reference Rose K. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proc IEEE. 1998;86(11):2210–39.CrossRef Rose K. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proc IEEE. 1998;86(11):2210–39.CrossRef
18.
go back to reference Szu HH, Hartley RL. Nonconvex optimization by fast simulated annealing. Proc IEEE. 1987;75:1538–40.CrossRef Szu HH, Hartley RL. Nonconvex optimization by fast simulated annealing. Proc IEEE. 1987;75:1538–40.CrossRef
19.
go back to reference Tsallis C, Stariolo DA. Generalized simulated annealing. Phys A. 1996;233:395–406.CrossRef Tsallis C, Stariolo DA. Generalized simulated annealing. Phys A. 1996;233:395–406.CrossRef
20.
go back to reference Ventresca M, Tizhoosh HR. Simulated annealing with opposite neighbors. In: Proceedings of the IEEE symposium on foundations of computational intelligence (SIS 2007), Honolulu, Hawaii, 2007. p. 186–192. Ventresca M, Tizhoosh HR. Simulated annealing with opposite neighbors. In: Proceedings of the IEEE symposium on foundations of computational intelligence (SIS 2007), Honolulu, Hawaii, 2007. p. 186–192.
21.
go back to reference Xavier-de-Souza S, Suykens JAK, Vandewalle J, Bolle D. Coupled simulated annealing. IEEE Trans Syst Man Cybern Part B. 2010;40(2):320–35.CrossRef Xavier-de-Souza S, Suykens JAK, Vandewalle J, Bolle D. Coupled simulated annealing. IEEE Trans Syst Man Cybern Part B. 2010;40(2):320–35.CrossRef
Metadata
Title
Simulated Annealing
Authors
Ke-Lin Du
M. N. S. Swamy
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-41192-7_2

Premium Partner