The adaptive Simulated Annealing is a variant of simulated annealing (SA) algorithm in which the algorithm parameters that control temperature schedule and random step selection are automatically adjusted according to algorithm progress. This means the algorithm more efficient and less sensitive to user defined parameters. These are in the standard variant often selected on the basis of experience and experimentation (since optimal values are problem dependent), which represents a significant deficiency in practice. Simulated annealing (SA) is a generic probabilistic meta-algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. ...

References

• L. Ingber, Very fast simulated re-annealing, Mathl. Comput. Modelling,Vol. 12 No. 8 ,pp. 967-973 , 1989.
• L. Ingber, Simulated annealing: Practice versus theory, Mathl. Comput. Modelling, Vol. 18 No. 11, pp.29-57, 1993.
• L. Ingber, Adaptive simulated annealing (ASA): Lessons learned, Control and Cybernetics,Vol. 25 No. 1,pp. 33-54, 1996.

See also

• Simulated annealing
• Combinatorial optimization
• Optimization

Simulated annealing (SA) is a generic probabilistic meta-algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. ... Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory. ... In mathematics, the term optimization refers to the study of problems that have the form Given: a function f : A R from some set A to the real numbers Sought: an element x0 in A such that f(x0) ≤ f(x) for all x in A (minimization) or such that...

External links

• Global optimization Explains some ideas behind ASA.