Chapter Five: Simulated annealing
Abstract
The focus of this chapter is on a single-solution-based algorithm, named simulated annealing (SA). A simple example is first given to show the search behavior of SA in the landscape of the solution space. The basic idea and pseudocode of SA as well as the probability equations for accepting a non-improving candidate solution are also given. The source code and simulation results of SA are then presented to show how to realize SA to solve the one-max and deceptive optimization problems. Finally, a brief survey on the historical development of SA and its applications is given to show the possibilities of SA.
Keywords
simulated annealing; non-improving candidate solution; single-solution-based metaheuristic ...
Get Handbook of Metaheuristic Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
