摘要
Simulated annealing is a new kind of random search methods developed in recent years.it can also be considered as an extension to the classical hill-climbing method in AI——probabilistic hill-cimbing.One of its most important features is its global convergence.The convergence of simulated annealing algorithm is determined by state generating probability,state accepting probability,and temperature decreasing rate.This paper gives a generalized simulated annealing algorithm with dynamic generating and accepting probabilities.The paper also shows that the generating and accepting probabilities can adopt many different kinds of distributions while the global convergence is guaranteed.
Simulated annealing is a new kind of random search methods developed in recent years.it can also be considered as an extension to the classical hill-climbing method in AI——probabilistic hill-cimbing.One of its most important features is its global convergence.The convergence of simulated annealing algorithm is determined by state generating probability,state accepting probability,and temperature decreasing rate.This paper gives a generalized simulated annealing algorithm with dynamic generating and accepting probabilities.The paper also shows that the generating and accepting probabilities can adopt many different kinds of distributions while the global convergence is guaranteed.
基金
This research is supported by the National 863 Project of China.
