Finite-Time Performance Analysis of Static Simulated Annealing Algorithms
Computational Optimization and Applications
Analysis of static simulated annealing algorithms
Journal of Optimization Theory and Applications
Global Optimization Performance Measures for Generalized Hill Climbing Algorithms
Journal of Global Optimization
An analytically derived cooling schedule for simulated annealing
Journal of Global Optimization
Hi-index | 0.00 |
Contrary to conventional belief, it turns out that in some problem instances of moderate size, fixed temperature simulated annealing algorithms based on a heuristic formula for determining the optimal temperature can be superior to algorithms based on cooling. Such a heuristic formula, however, often seems elusive. In practical cases considered we include instances of traveling salesman, quadratic assignment, and graph partitioning problems, where we obtain results that compare favorably to the ones known in the literature.