Skip to main content
SpringerLink
Log in

Sequential Monte Carlo simulated annealing

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we propose a population-based optimization algorithm, Sequential Monte Carlo Simulated Annealing (SMC-SA), for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of Boltzmann distributions in simulated annealing. We prove an upper bound on the difference between the empirical distribution yielded by SMC-SA and the Boltzmann distribution, which gives guidance on the choice of the temperature cooling schedule and the number of samples used at each iteration. We also prove that SMC-SA is more preferable than the multi-start simulated annealing method when the sample size is sufficiently large.

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. Alazamir, S., Rebennack, S., Pardalos, P.M.: Chapter 18: improving the neighborhood selection strategy in simulated annealing using optimal stopping problem. In: Global Optimization: Focus on Simulated Annealing. Energy Systems, pp. 363–382. I-Tech Education and Publication (2008)

  2. Anily S., Federgruen A.: Simulated annealing methods with general acceptance probabilities. J. Appl. Probab. 24(3), 657–667 (1987)

    Article  Google Scholar 

  3. Belisle C.J.P.: Convergence theorems for a class of simulated annealing algorithms on Rd. J. Appl. Probab. 29, 885–895 (1992)

    Article  Google Scholar 

  4. Cappé O., Godsill S.J., Moulines E.: An overview of existing methods and recent advances in sequential Monte Carlo. Proc. IEEE 95(5), 899–924 (2007)

    Article  Google Scholar 

  5. Chu K.W., Deng Y., Reinitzy J.: Parallel simulated annealing by mixing of states. J. Comput. Phys. 148, 646–662 (1999)

    Article  Google Scholar 

  6. Corana A., Marchesi M., Martini C., Ridella S.: Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Trans. Math. Softw. 13(3), 208–262 (1987)

    Article  Google Scholar 

  7. DeBoer P.T., Kroese D.P., Mannor S., Rubinstein R.Y.: A tutorial on the cross-entropy method. Ann. Oper. Res. 134, 19–67 (2005)

    Article  Google Scholar 

  8. Dekkers A., Aarts E.: Global optimization and simulated annealing. Math. Program. 50(3), 367–393 (1991)

    Article  Google Scholar 

  9. Doucet, A., deFreitas, J.F.G., Gordon, N.J. (eds.): Sequential Monte Carlo Methods in Practice. Springer, New York (2001)

    Google Scholar 

  10. Doucet A., Godsill S., Andrieu C.: On sequential Monte Carlo sampling methods for Bayesian filtering. Stat. Comput. 10(3), 197–208 (2000)

    Article  Google Scholar 

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

    Article  Google Scholar 

  12. Gidas B.: Nonstationary Markov chains and convergence of the annealing algorithm. J. Stat. Phys. 39(1–2), 73–131 (1985)

    Article  Google Scholar 

  13. Gilks W., Berzuini C.: Following a moving target—Monte Carlo inference for dynamic Bayesian models. J. R. Stat. Soc. 63(1), 127–146 (2001)

    Article  Google Scholar 

  14. Gordon N.J., Salmond D.J., Smith A.F.M.: Novel approach to nonlinear/non-Gaussian Bayesian state estimation. IEE Proc. F (Radar Signal Process) 140(2), 107–113 (1993)

    Article  Google Scholar 

  15. Hajek B.: Cooling schedules for optimal annealing. Math. Oper. Res. 13(2), 311–329 (1988)

    Article  Google Scholar 

  16. Henderson, D., Jacobson, S.H., Johnson, A.W.: Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, chapter The Theory and Practice of Simulated Annealing, pp. 287–319. Springer (2003)

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

    Article  Google Scholar 

  18. Kroese D.P., Porotsky S., Rubinstein R.Y.: The cross-entropy method for continuous multiextremal optimization. Methodol. Comput. Appl. Probab. 8(3), 383–407 (2006)

    Article  Google Scholar 

  19. Liu J., Chen R.: Sequential Monte Carlo methods for dynamic systems. J. Am. Stat. Assoc. 93(443), 1032–1044 (1998)

    Article  Google Scholar 

  20. Locatelli M.: Convergence properties of simulated annealing for continuous global optimization. J. Appl. Probab. 33, 1127–1140 (1996)

    Article  Google Scholar 

  21. Locatelli M.: Simulated annealing algorithms for continuous global optimization: convergence conditions. J. Optim. Theory Appl. 104(1), 121–133 (2000)

    Article  Google Scholar 

  22. Mahfoud S.W., Goldberg D.E.: Parallel recombinative simulated annealing: a genetic algorithm. Parallel Comput. 21, 1–28 (1995)

    Article  Google Scholar 

  23. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)

    Article  Google Scholar 

  24. Molvalioglu, O., Zabinsky, Z.B., Kohn, W.: Models and Algorithms for Global Optimization, volume 4 of Springer Optimization and Its Applications, chapter Multi-particle Simulated Annealing, pp. 215–222. Springer (2007)

  25. Molvalioglu O., Zabinsky Z.B., Kohn W.: The interacting-particle algorithm with dynamic heating and cooling. J. Global Optim. 43(2–3), 329–356 (2009)

    Article  Google Scholar 

  26. Del Moral P.: Feynman-Kac Formulae: Genealogical and Interacting Particle Systems with Applications. Springer, New York (2004)

    Google Scholar 

  27. Del Moral P., Doucet A., France T.: Sequential Monte Carlo samplers. J. R. Stat. Soc. Ser. B 68(3), 411–436 (2006)

    Article  Google Scholar 

  28. Onbaşoğlu E., L.: Parallel simulated annealing algorithms in global optimization. J. Global Optim. 19(1), 27–50 (2001)

    Article  Google Scholar 

  29. Pardalos, P.M., Romeijn, H.E. (eds.): Handbook of Global Optimization, vol. 2. Kluwer, Dordrecht (2002)

    Google Scholar 

  30. Pintér J.D.: Global Optimization in Action. Kluwer, Dordrecht, The Neitherlands (1996)

    Google Scholar 

  31. Robert C.P., Casella G.: Monte Carlo Statistical Methods. Springer Texts in Statistics. Springer, New York (2004)

    Google Scholar 

  32. Roberts G., Rosenthal J.S.: General state spact Markov chains and MCMC algorithms. Probab. Surv. 1, 20–71 (2004)

    Article  Google Scholar 

  33. Romeijn H.E., Smith R.L.: Simulated annealing for constrained global optimization. J. Global Optim. 5(2), 101–126 (1994)

    Article  Google Scholar 

  34. Rubinstein R.Y.: The cross-entropy method for combinatorial and continuous optimization. Methodol. Comput. Appl. Probab. 1(2), 127–190 (1999)

    Article  Google Scholar 

  35. Rubinstein R.Y.: Combinatorial optimization, ants and rare events. In: Uryasev, S., Pardalos, P.M. (eds.) Stochastic Optimization: Algorithms and Applications, pp. 304–358. Kluwer, Dordrecht, The Netherlands (2001)

    Google Scholar 

  36. Ruppeiner G., Pedersen J.M., Salamon P.: Ensemble approach to simulated annealing. Journal de Physics I 1, 455–470 (1991)

    Google Scholar 

  37. Spall, J.C.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley (2005)

  38. van Hentenryck, P., Vergados, Y.: Population-based simulated annealing for traveling tournaments. In: Proceedings of the 22nd National Conference on Artificial Intelligence, vol. 1, pp. 267–272 (2007)

  39. van Laarhoven P.J.M., Aarts E.H.L.: Simulated Annealing: Theory and Applications. Springer, Berlin (1987)

    Book  Google Scholar 

  40. Yang R.L.: Convergence of the simulated annealing algorithm for continuous global optimization. J. Optim. Theory. Appl. 104(3), 691–716 (2000)

    Article  Google Scholar 

  41. Yao, X., Liu, Y.: Fast evolutionary programming. In: Proceedings of the 5th Annual Conference on Evolutionary Programming, pp. 451–460. MIT Press, Cambridge (1996)

  42. Zhigljavsky A.A.: Theory of Global Random Search. Kluwer, Dordrecht (1991)

    Book  Google Scholar 

  43. Zhiljavsky, A., Zilinskas, A.: Stochastic Global Optimization, volume 9 of Springer Optimization and its Applications. Springer (2008)

  44. Zhou, E., Chen, X.: A new population-based simulated annealing algorithm. In: Proceedings of the 2010 Winter Simulation Conference, pp. 1211–1222 (2010)

Download references

Author information

Authors and Affiliations

  1. Department of Industrial & Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, 61801, USA

    Enlu Zhou & Xi Chen

Authors
  1. Enlu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Enlu Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, E., Chen, X. Sequential Monte Carlo simulated annealing. J Glob Optim 55, 101–124 (2013). https://doi.org/10.1007/s10898-011-9838-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9838-3

Keywords

Search

Navigation