Abstract
This chapter introduces simulated annealing, an algorithmic method that produces approximate solutions for optimization problems with certain mathematical properties. The name of this magical method is due to an analogy with an industrial technique that involves the heating and controlled cooling – annealing – of a material to improve its stability. The author first uses a tiling game to demonstrate the principle, and he then outlines how the technique may be applied to the travelling salesman problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rossmanith, P. (2011). Simulated Annealing. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)