Extremal Optimization

We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively replaces extremely undesirable elements of a single sub-optimal solution with new, random ones. Large fluctuations ensue that efficiently explore many local optima. With only one adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions which are believed to contain the hardest instances. We use extremal optimization to elucidate the phase transition in the 3coloring problem, and we provide independent confirmation of previously reported results for the ground-state energy of ±J spin glasses in d = 3 and 4. PACS number(s): 02.60.Pn, 05.65.+b, 75.10.Nr, 64.60.Cn.

[1]  Harry B. Hunt,et al.  Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results , 1995, Satisfiability Problem: Theory and Applications.

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

[3]  Martin,et al.  Finite size and dimensional dependence in the Euclidean traveling salesman problem. , 1996, Physical review letters.

[4]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

[6]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[8]  Joseph C. Culberson,et al.  Frozen development in graph coloring , 2001, Theor. Comput. Sci..

[9]  A. Percus,et al.  How do ovarian follicles interact? A many-body problem with unusual symmetry and symmetry-breaking properties , 1991 .

[10]  Harry B. Hunt,et al.  Theory of periodically specified problems: complexity and approximability , 1997, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[11]  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.

[12]  O. Martin,et al.  The Stochastic Traveling Salesman Problem: Finite Size Scaling and the Cavity Prediction , 1998, cond-mat/9802295.

[13]  O. Bohigas,et al.  The random link approximation for the Euclidean traveling salesman problem , 1996, cond-mat/9607080.

[14]  David C. Torney,et al.  Greedy algorithms for optimized DNA sequencing , 1999, SODA '99.

[15]  A. Rbnyi ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

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

[17]  Paczuski,et al.  Exact results for spatiotemporal correlations in a self-organized critical model of punctuated equilibrium. , 1995, Physical review letters.

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

[19]  Madhav V. Marathe,et al.  On Approximation Algorithms for the Minimum Satisfiability Problem , 1996, Inf. Process. Lett..

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

[21]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.