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
Optimized network dimensioning and planning for WiMAX technology
Ad Hoc Networks
| Hi-index | 0.00 |
This article presents an empirical approach that demonstrates a theoretical connection between (information theoretic) entropy measures and the finite-time performance of the simulated annealing algorithm. The methodology developed leads to several computational approaches for creating problem instances useful in testing and demonstrating the entropy/performance connection: use of generic configuration spaces, polynomial transformations between NP-hard problems, and modification of penalty parameters. In particular, the computational results show that higher entropy measures are associated with superior finite-time performance of the simulated annealing algorithm.