Bouncing towards the optimum: Improving the results of Monte Carlo optimization algorithms

DOI zum Zitieren dieses Dokuments:: 10.5283/epub.16106

Schneider, Johannes ; Morgenstern, Ingo ; Singer, Johannes Maria

PDF
(305kB) - Nur für Mitarbeiter des Archivs

Veröffentlichungsdatum dieses Volltextes: 09 Aug 2010 12:13

Alternative Links zum Volltext:DOI

Details

Bibliographische Daten exportieren

Zusammenfassung

Simulated annealing and related Monte Carlo-type optimization algorithms are used to apply statistical physics concepts, in particular ideas from the statistical mechanics of spin glasses, to find optimal configurations for combinatorial optimization problems. There are formal proofs showing that these algorithms converge asymptotically (i.e.—possibly—for infinitely long simulation times) to a ...