@inbook {IOPORT.06019551,
    author       = {Jansen, Thomas},
    title        = {Simulated annealing.},
    year         = {2011},
    booktitle    = {Theory of randomized search heuristics. Foundations and recent developments.},
    isbn         = {978-981-4282-66-6},
    pages        = {171-195},
    publisher    = {Hackensack, NJ: World Scientific},
    abstract     = {Summary: Simulated annealing is a randomized search heuristic that is inspired by the annealing process in metallurgy. Like randomized local search it solves optimization problems by randomly moving from one candidate solution to a neighboring one. Unlike randomized local search it accepts such a move with a positive probability even if the new candidate solution is worse. The probability of accepting such a worsening move depends on the difference in function value and the current temperature that is defined by a cooling schedule. Using a constant temperature without any annealing yields the Metropolis algorithm. The most important theoretical results concerning simulated annealing are given. The emphasis is on results concerning the performance by means of analyzing the optimization time. Concentrating mainly on combinatorial optimization problems strengths and weaknesses of simulated annealing are highlighted. Thorough analytical comparisons with the Metropolis algorithm and a simple and structurally similar evolutionary algorithm, the (1+1) EA, are presented.},
    identifier   = {06019551},
}