Advertisement

Simulated Annealing

Chapter
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 36)

Abstract

Simulated Annealing is a meta-heuristic that performs a randomized local search to reach near-optimal solutions of combinatorial as well as continuous optimization problems. In this chapter we show how it can be used to train artificial neural networks by examples. Experimental results indicate that good results can be obtained with little or no tuning.

Key words

Simulated annealing neural networks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E. H. L., and Korst, J. H. M., 1989, Simulated Annealing and Boltzmann Machines, Wiley.Google Scholar
  2. Ackley, D. H., Hinton, G. E., and Sejnowski, T. J., 1985, A learning algorithm for Boltzmann machines, Cognitive Science 9: 147–169.CrossRefGoogle Scholar
  3. Binder, K., 1978, Monte Carlo Methods in Statistical Physics, Springer-Verlag.Google Scholar
  4. Cerny, V., 1985, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications 45: 41–51.zbMATHMathSciNetCrossRefGoogle Scholar
  5. Glover, F., and Martí, R., 2006, Tabu search, Chapter 4 in this book.Google Scholar
  6. Hopfield, J. J., 1982, Neural networks and physical systems with emergent collective computational abilities, Procs. of the Natl. Academy of Sciences of the USA 79: 2554–2558.MathSciNetCrossRefADSGoogle Scholar
  7. Hopfield, J. J., 1984, Neurons with graded response have collective computational properties like those of two-state neurons, Proceedings of the National Academy of Sciences of the USA 81: 3088–3092.PubMedCrossRefADSGoogle Scholar
  8. Feller, W., 1950, An Introduction to Probability Theory and Its Applications 1, Wiley.Google Scholar
  9. Fox, B. L., 1994, Random restart versus simulated annealing, Computers & Mathematics with Applications, 27:33–35.zbMATHCrossRefGoogle Scholar
  10. Isaacson, D., and Madsen, R., 1976, Markov Chains, Wiley.Google Scholar
  11. Kirkpatrick, S., Gelatt Jr., C. D., and Vecchi, M. P., 1983, Optimization by simulated annealing, Science 220: 671–680.MathSciNetADSCrossRefGoogle Scholar
  12. Lourenço, H. R., Martin, O., and Stützle, T., 2002, Iterated local search, in: Handbook of Metaheuristics, F. Glover and G. Kochenberger, eds., Kluwer A. P., 321–353.Google Scholar
  13. Seneta, E., 1981, Non-negative matrices and Markov chains, Springer-Verlag.Google Scholar
  14. Sexton, R.S., Alidaee, B., Dorsey, E., and Johnson, J. D., 1998, Global optimization for artificial neural networks: a tabu search application, European Journal of Operational Research 106: 570–584.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.Philips Research LaboratoriesEindhovenThe Netherlands

Personalised recommendations