Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results

Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results

0.00 Avg rating0 Votes
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: ,
Keywords: optimization: simulated annealing
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.