Nolte, Andreas and Schrader, Rainer (2000). A Note on the Finite Time Behaviour of Simulated Annealing. Mathematics of operations research, 25 (3). pp. 476-484. Informs.

[thumbnail of zaik1999-347.pdf]
Preview
 PDF
zaik1999-347.pdf - Draft Version
Download (222kB) | Preview

Abstract

Simulated Annealing has proven to be a very sucessful heuristic for various combinatorial optimization problems. It is a randomized algorithm that attempts to find the global optimum with high probability by local exchanges. In this paper we give a new proof of the convergence of Simulated Annealing by applying results about rapidly mixing Markov chains. With this proof technique it is possible to obtain better bounds for the finite time behaviour of Simulated Annealing than previously known.

Item Type: Article
Creators:
Creators
Email
ORCID
ORCID Put Code
Nolte, Andreas
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Schrader, Rainer
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-548230
Journal or Publication Title: Mathematics of operations research
Volume: 25
Number: 3
Page Range: pp. 476-484
Date: 2000
Publisher: Informs
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54823

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item