Skip to main content
SpringerLink
Log in

General simulated annealing

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Simulated annealing is a new kind of random search methods developed in recent years. It can also be considered as an extension to the classical hill-climbing method in AI—probabilistic hill climbing. One of its most important features is its global convergence. The convergence of simulated annealing algorithm is determined by state generating probability, state accepting probability, and temperature decreasing rate. This paper gives a generalized simulated annealing algorithm with dynamic generating and accepting probabilities. The paper also shows that the generating and accepting probabilities can adopt many different kinds of distributions while the global convergence is guaranteed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

  2. V. Cerny, Thermodynamical approach to the Traveling Salesman Problem: an efficient simulation algorithm.J. Opt. Theory Appl.,45 (1985), 41–51.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Gemen and D. Gemen, Stochastic relaxation, Gibbs distributions, and the Bayes restoration of images.IEEE Trans. Patt. Anal. Mach. Intell., PAMI-6: 6 (1984), 721–741.

    Google Scholar 

  4. D.H. Ackley, G.E. Hinton and T.J. Sejnowski, A learning algorithm for Boltzmann machines.Cognitive Science,9 (1985), 147–169.

    Article  Google Scholar 

  5. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, Equations of state calculations by fast computing machines.J. Chem. Phys.,21 (1983), 1087–1091.

    Article  Google Scholar 

  6. D.L. Isaacson and R.W. Madsen, Markov Chains: Theory and Applications. John Wiley & Sons, Inc., 1976.

  7. H.H. Szu and R.L. Hartley, Nonconvex optimization by fast simulated annealing.Proc. of IEEE,75:11 (1987), 1538–1540.

    Article  Google Scholar 

  8. S. Anily and A. Federgruen, Simulated annealing methods with general acceptance probabilities.J. Appl. Prob.,24 (1987), 657–667.

    Article  MATH  MathSciNet  Google Scholar 

  9. S. Anily and A. Federgruen, Ergodicity in parameteric nonstationary Markov chains: An application to annealing methods.Oper. Res.,35:6 (1987), 867–874.

    Article  MATH  MathSciNet  Google Scholar 

  10. Yao Xin and Li Guo-Jie, Performance analysis of simulated annealing. Proc. of the 3rd Pan-Pacific Computer Conference (PPCC-3), Beijing, China, 1989.

  11. H.L. Royden, Real Analysis. 2nd edn., Macmillan Publishing Co., Inc., 1968.

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Science and Technology of China, 230026, Anhui

    Yao Xin

  2. National Research Center for Intelligent Computing Systems, 100080, Beijing

    Li Guojie

Authors
  1. Yao Xin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Guojie
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is supported by the National 863 Project of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yao, X., Li, G. General simulated annealing. J. of Comput. Sci. & Technol. 6, 329–338 (1991). https://doi.org/10.1007/BF02948392

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948392

Keywords

Search

Navigation