Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
Mark Fleischer, Sheldon H. Jacobson
INFORMS Journal on Computing · 1999 · Volume 11 · Issue 1
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.
Keywords
logic modeling and computation, information theory, simulated annealing, entropy
Enable JavaScript for citation tools and additional paper interactions.