Article ID: | iaor20001029 |
Country: | United States |
Volume: | 11 |
Issue: | 1 |
Start Page Number: | 35 |
End Page Number: | 43 |
Publication Date: | Dec 1999 |
Journal: | INFORMS Journal On Computing |
Authors: | Jacobson Sheldon H., Fleischer Mark |
Keywords: | optimization: simulated annealing |
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