A new simulated annealing algorithm
Author:
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 56 (3-4) , 161-168
Abstract
Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems for which little prior knowledge is available. The annealing schedule, i.e., the temperature decreasing rate used in SA is an important factor which affects SA's rate of convergence. This paper investigates annealing schedules used in various SA algorithms, e.g., the classical SA (CSA) [1], fast SA (FSA) [2] and very fast SA (VFSA) [3], and proposes a new SA (NSA) algorithm whose annealing schedule is exponentially faster than that of VFSA. The heuristic proof given in the paper follows the same method as that used by Szu and Hartley [2] and Ingber [3] in their studies. The paper also discusses the relationship between the annealing schedule and SA's rate of convergenceKeywords
This publication has 5 references indexed in Scilit:
- Simulated annealing with extended neighbourhoodInternational Journal of Computer Mathematics, 1991
- Very fast simulated re-annealingMathematical and Computer Modelling, 1989
- Fast simulated annealingPhysics Letters A, 1987
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Optimization by Simulated AnnealingScience, 1983