Optimizing at the ergodic edge

Stefan Boettcher and Martin Frank

Physica A: Statistical Mechanics and its Applications, 2006, vol. 367, issue C, 220-230

Abstract: Using a simple, annealed model, some of the key features of the recently introduced extremal optimization heuristic are demonstrated. In particular, it is shown that the dynamics of local search possesses a generic critical point under the variation of its sole parameter, separating phases of too greedy (non-ergodic, jammed) and too random (ergodic) exploration. Comparison of various local search methods within this model suggests that the existence of the critical point is essential for the optimal performance of the heuristic.

Keywords: Extremal optimization; Heuristics; Jamming; Combinatorial optimization; Simulated annealing (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437105011398
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:367:y:2006:i:c:p:220-230

DOI: 10.1016/j.physa.2005.10.034

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().