Cooling schedules for optimal annealing
Mathematics of Operations Research
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Simulated Annealing: Searching for an Optimal Temperature Schedule
SIAM Journal on Optimization
On the acceleration of simulated annealing
On the acceleration of simulated annealing
Parallel simulated annealing algorithm for graph coloring problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Using Constrained Optimization for the Identification of Convergence Clubs
Computational Economics
Telescoping strategies for improved parameter estimation of environmental simulation models
Computers & Geosciences
| Hi-index | 0.00 |
The classical version of simulated annealing is based on a cooling schedule. Generally, the initial temperature is set such that the acceptance ratio of bad moves is equal to a certain value χ0. In this paper, we first propose a simple algorithm to compute a temperature which is compatible with a given acceptance ratio. Then, we study the properties of the acceptance probability. It is shown that this function is convex for low temperatures and concave for high temperatures. We also provide a lower bound for the number of plateaux of a simulated annealing based on a geometric cooling schedule. Finally, many numerical experiments are reported.