ON CONVERGENCE OF ANNEALING ALGORITHM
Fan Yang · 1991
The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain difficult problems,including NP-hard combinatorial ones such as the travelling salesman(TSP),circuit placement and routing.It has also been applied to the learning phase of Neural Network.In this paper,the convergence of this widely used algorithm is analy- sed and the criteria of some operations in annealing process are explained.