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 makes the algorithm more efficient and less sensitive to user defined parameters than canonical SA. 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.
The algorithm works by representing the parameters of the function to be optimized as continuous numbers, and as dimensions of a hypercube (N dimensional space). Some SA algorithms apply Gaussian moves to the state, while others have distributions permitting faster temperature schedules. Imagine the state as a point in a box and the moves as a rugby-ball shaped cloud around it. The temperature and the step size are adjusted so that all of the search space is sampled to a coarse resolution in the early stages, whilst the state is directed to favorable areas in the late stages.
- L. Ingber, ASA-CODE, ASA-REPRINTS, ASA-INFO Global optimization C-code, Caltech Alumni Association, Pasadena, CA, 1993.
- 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.
- Global optimization Explains some ideas behind ASA.
- Adaptive Simulated Annealing (ASA) Explains history and use of the ASA code, first published as Very Fast Simulated Reannealing (VFSR) in 1989, and made available to the public at no charge since 1993 under the name ASA. This ASA algorithm is not the same as the algorithm described at the top of http://en.wikipedia.org/wiki/Adaptive_simulated_annealing or in http://www.sinopt.com/learning1/desnotes/globopt.htm.