On the asymptotic convergence of the simulated annealing algorithm in the presence of a parameter dependent penalization

P.C. Schuur

Research output: Book/ReportReportAcademic

28 Downloads (Pure)

Abstract

We establish asymptotic convergence of the standard simulated annealing algorithm - when used with a parameter dependent penalization - to the set of globally optimal solutions of the original combinatorial optimization problem. Precise and explicit asymptotic estimates are given. Moreover, we present an explicit description of the asymptotic behaviour of the expected cost, the variance of the cost and the entropy. We show that familiar properties like monotonicity of the expected cost and the entropy are no longer guaranteed in the penalized case and discuss the practical consequences of our results.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages17
Publication statusPublished - 1989

Publication series

NameMemorandum COSOR
Volume8916
ISSN (Print)0926-4493

Fingerprint Dive into the research topics of 'On the asymptotic convergence of the simulated annealing algorithm in the presence of a parameter dependent penalization'. Together they form a unique fingerprint.

Cite this