Standard Article

Effective Application of Simulated Annealing

  1. Jeffrey W. Ohlmann1,
  2. Jon W. Van Laarhoven2

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0283

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Ohlmann, J. W. and Van Laarhoven, J. W. 2011. Effective Application of Simulated Annealing. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. 1

    University of Iowa, Department of Management Sciences, Iowa City, Iowa

  2. 2

    University of Iowa, Department of Applied Mathematics and Computational Sciences, Iowa City, Iowa

Publication History

  1. Published Online: 15 FEB 2011

Abstract

First adapted as a solution approach for combinatorial optimization problems in the 1980s, simulated annealing and its variants continue to enjoy widespread application. The widespread application of SA is due to the relative ease of implementing its logic, its general nature and flexibility allowing use with little problem-specific tailoring (at least for alpha versions of an implementation), and its robust performance with respect to solution quality and running time on a wide array of problems. This article describes implementation details for various features of the simulated annealing algorithm, and then illustrates the development of annealing-based algorithms through the description of several applications.

Keywords:

  • simulated annealing;
  • local search;
  • metaheuristics;
  • heuristic search