Extremal Optimization: Heuristics Via Co-Evolutionary Avalanches

The extremal dynamics of the Bak-Sneppen model can be converted into an optimization algorithm called extremal optimization. Attractive features of the model include the following: it is straightforward to relate the sum of all fitnesses to the cost function of the system; in the self-organized critical state to which the system inevitably evolves, almost all species have a much better than random fitness; most species preserve a good fitness for long times unless they are connected to poorly adapted species, providing the system with a long memory; the system retains a potential for large, hill-climbing fluctuations at any stage; and the model accomplishes these features without any control parameters.

[1]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[2]  Brian W. Kernighan,et al.  The Practice of Programming , 1999 .

[3]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[4]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Bernd Freisleben,et al.  Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem , 1998, PPSN.

[7]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[8]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[9]  Paczuski,et al.  Ultrametricity and memory in a solvable model of self-organized criticality. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[10]  P. Bak,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[11]  A. Percus,et al.  Nature's Way of Optimizing , 1999, Artif. Intell..

[12]  Károly F. Pál,et al.  The ground state energy of the Edwards-Anderson Ising spin glass with a hybrid genetic algorithm , 1996 .

[13]  M. E. J. Newman,et al.  Simple Models of Evolution and Extinction , 1999, adap-org/9910003.

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  J. Machta,et al.  The computational complexity of generating random fractals , 1996 .

[16]  Béla Bollobás,et al.  Random Graphs , 1985 .

[17]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[20]  Tad Hogg,et al.  Phase Transitions and the Search Problem , 1996, Artif. Intell..

[21]  K. Mellanby.  How Nature works , 1978, Nature.

[22]  Bak,et al.  Punctuated equilibrium and criticality in a simple model of evolution. , 1993, Physical review letters.

[23]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[24]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[25]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[26]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  S. Boettcher.  Extremal Optimization of Graph Partitioning at the Percolation Threshold , 1999, cond-mat/9901353.

[28]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[29]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[30]  Stefan Boettcher,et al.  Extremal Optimization: Methods derived from Co-Evolution , 1999, GECCO.

[31]  Francis Sullivan,et al.  The Metropolis Algorithm , 2000, Computing in Science & Engineering.

[32]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[33]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.