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

Simple item page
dc.contributorVirginia Techen
dc.contributor.authorFleischer, M.en
dc.contributor.authorJacobson, Sheldon H.en
dc.contributor.departmentIndustrial and Systems Engineeringen
dc.date.accessed2014-02-05en
dc.date.accessioned2014-03-05T14:00:23Zen
dc.date.available2014-03-05T14:00:23Zen
dc.date.issued1999en
dc.description.abstractThis 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 reads 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.en
dc.description.sponsorshipNASA NAS1-19858-13en
dc.description.sponsorshipNSF DMI-9409266, DMI-9423929en
dc.description.sponsorshipAFOSR F49620-95-1-0124, F49620-98-1-0111en
dc.format.mimetypeapplication/pdfen
dc.identifier.citationFleischer, M; Jacobson, SH. Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results. INFORMS Journal on Computing 1999 11:1, 35-43. doi: 10.1287/ijoc.11.1.35en
dc.identifier.doihttps://doi.org/10.1287/ijoc.11.1.35en
dc.identifier.issn1091-9856en
dc.identifier.urihttp://hdl.handle.net/10919/25830en
dc.identifier.urlhttp://pubsonline.informs.org/doi/pdf/10.1287/ijoc.11.1.35en
dc.language.isoenen
dc.publisherINFORMSen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectLogic modeling and computationen
dc.subjectInformation theoryen
dc.subjectSimulated annealingen
dc.subjectEntropyen
dc.titleInformation theory and the finite-time behavior of the simulated annealing algorithm: Experimental resultsen
dc.title.serialInforms Journal on Computingen
dc.typeArticleen
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ijoc%2E11%2E1%2E35.pdf
Size:
190.73 KB
Format:
Adobe Portable Document Format
Description:
Main article
Download

Collections

Scholarly Works, Industrial and Systems Engineering