Extremal optimization: An evolutionary local-search algorithm

Operations Research/ Computer Science Interfaces Series

Volumn 21, Issue , 2003, Pages 61-77

  Boettcher, Stefan ^a   Perçus, Allon G ^b  

^a EMORY UNIVERSITY   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Combinatorial optimization; Evolutionary algorithms; Heuristic methods; Self organized criticality

Indexed keywords

EID: 84888773780     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1043-7     Document Type: Article

References (57)

1. E. H. L. Aarts and P. J. M. van Laarhoven, Statistical Cooling: A general Approach to Combinatorial Optimization Problems, Philips J. Res. 40, 193-226 (1985).
2. E. H. L. Aarts and P. J. M. van Laarhoven, Simulated Annealing: Theory and Applications (Reidel, Dordrecht, 1987).
3. Local Search in Combinatorial Optimization, Eds. E. H. L. Aarts and J. K. Lenstra (Wiley, New York, 1997).
4. See Frontiers in problem solving: Phase transitions and complexity, eds. T. Hogg, B. A. Huberman, and C. Williams, special issue of Artificial Intelligence 81:1-2 (1996).
5. G. Ausiello et al., Complexity and Approximation (Springer, Berlin, 1999).
6. P. Bak and K. Sneppen, Punctuated Equilibrium and Criticality in a simple Model of Evolution, Phys. Rev. Lett. 71, 4083-4086 (1993).
7. P. Bak, C. Tang, and K. Wiesenfeld, Self-Organized Criticality, Phys. Rev. Lett. 59, 381-384 (1987).
8. S. Boettcher, Extremal Optimization and Graph Partitioning at the Percolation Threshold, J. Math. Phys. A: Math. Gen. 32, 5201-5211 (1999).
9. S. Boettcher, Extremal Optimization: Heuristics via Co-Evolutionary Avalanches, Computing in Science and Engineering 2:6, 75 (2000).
10. S. Boettcher and M. Frank, Analysis of Extremal Optimization in Designed Search Spaces, Honors Thesis, Dept. of Physics, Emory University, (in preparation).
11. S. Boettcher and M. Grigni, Jamming model for the extremal optimization heuristic, J. Phys. A: Math. Gen. 35 1109-1123 (2002).
12. S. Boettcher, M. Grigni, G. Istrate, and A. G. Perçus, Phase Transitions and Algorithmic Complexity in 3-Coloring, (in preparation).
13. S. Boettcher and A. G. Perçus, Extremal Optimization: Methods derived from Co-Evolution, in GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference (Morgan Kaufmann, San Francisco, 1999), 825-832.
14. S. Boettcher and A. G. Perçus, Nature's Way of Optimizing, Artificial Intelligence 119, 275-286 (2000).
15. S. Boettcher and A. G. Perçus, Optimization with Extremal Dynamics, Phys. Rev. Lett. 86, 5211-5214 (2001).
16. S. Boettcher and A. G. Perçus, Extremal Optimization for Graph Partitioning, Phys. Rev. E 64, 026114 (2001).
17. A. B. Bortz, M. H. Kalos, and J. L. Lebowitz, J. Comp. Phys. 17, 10-18 (1975).
18. P. Cheeseman, B. Kanefsky, and W. M. Taylor, Where the really hard Problems are, in Proc. of IJCAI-91, eds. J. Mylopoulos and R. Rediter (Morgan Kaufmann, San Mateo, CA, 1991), pp. 331-337.
19. H. Cohn and M. Fielding, Simulated Annealing: Searching for an optimal Temperature Schedule, SIAM J. Optim. 9, 779-802 (1999).
20. S. A. Cook, The Complexity of Theorem-Proving Procedures, in: Proc. 3rd Annual ACM Symp. on Theory of Computing, 151-158 (Assoc. for Computing Machinery, New York, 1971).
21. J. Culberson and I. P. Gent, Frozen Development in Graph Coloring, J. Theor. Comp. Sci. 265, 227-264 (2001).
22. J. Dall, Searching Complex State Spaces with Extremal Optimization and other Stochastics Techniques, Master Thesis, Fysisk Institut, Syddansk Universitet Odense, 2000 (in danish).
23. J. Dali and P. Sibani, Faster Monte Carlo Simulations at Low Temperatures: The Waiting Time Method, Computer Physics Communication 141, 260-267 (2001).
24. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1 (Wiley, New York, 1950).
25. M. Fielding, Simulated Annealing with an optimal fixed Temperature, SIAM J. Optim. 11, 289-307 (2000).
26. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979).
27. S. Geman and D. Geman, Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images, in Proc. 6th IEEE Pattern Analysis and Machine Intelligence, 721-741 (1984).
28. F. Glover, Future Paths for Integer Programming and Links to Artificial Intelligence, Computers & Ops. Res. 5, 533-549 (1986).
29. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, (Addison-Wesley, Reading, 1989).
30. S. J. Gould and N. Eldridge, Punctuated Equilibria: The Tempo and Mode of Evolution Reconsidered, Paleobiology 3, 115-151 (1977).
31. J. W. Greene and K. J. Supowit, Simulated Annealing without rejecting moves, IEEE Trans. on Computer-Aided Design CAD 5, 221-228 (1986).
32. A. K. Hartmann, Evidence for existence of many pure ground states in 3d±J Spin Glasses, Europhys. Lett. 40, 429 (1997).
33. B. A. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of Supercomputing '95, San Diego, CA (1995).
34. J. Houdayer and O. C. Martin, Renormalization for discrete optimization, Phys. Rev. Lett. 83, 1030-1033 (1999).
35. J. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975).
36. B. A. Huberman and T. Hogg, Phase transitions in artificial intelligence systems, Artificial Intelligence 33, 155-171 (1987).
37. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, in Approximation Algorithms for NP-hard Problems, ed. Dorit Hochbaum (PWS Publishers, 1996).
38. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Optimization by Simulated Annealing - an Experimental Evaluation. I. Graph Partitioning, Operations Research 37, 865-892 (1989).
39. 7th DIMACS Implementation Challenge on Semidefinite and related Optimization Problems, eds. D. S. Johnson, G. Pataki, and F. Alizadeh (to appear, see http://dimacs.rutgers.edu/Challenges/Seventh/).
40. M. Jiinger and F. Liers (Cologne University), private communication.
41. G. Karypis and V. Kumar, METIS, a Software Package for Partitioning Unstructured Graphs, see http://www-users.cs.umn.edu/~karypis/metis/main.shtml, (METIS is copyrighted by the Regents of the University of Minnisota).
42. S. Kirkpatrick, C. D. Gelatt, andM. P. Vecchi, Optimization by simulated annealing, Science 220,671-680 (1983).
43. S. Kirkpatrick and B. Selman, Critical Behavior in the Satisfiability of Random Boolean Expressions, Science 264, 1297-1301 (1994).
44. M. Lundy and A. Mees, Convergence of an Annealing Algorithm, Math. Programming 34, 111-124 (1996).
45. P. Merz and B. Freisleben, Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, Lect. Notes Comput. Sc. 1498, 165-171 (1998).
46. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21 (1953) 1087-1092.
47. M. Mezard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1987).
48. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity from characteristic 'phase transitions,' Nature 400, 133-137 (1999), and Random Struct. Alg 15, 414-435 (1999).
49. Meta-Heuristics: Theory and Application, Eds. I. H. Osman and J. P. Kelly (Kluwer, Boston, 1996).
50. K. F. Pal, The ground state energy of the Edwards-Anderson Ising spin glass with a hybrid genetic algorithm, Physica A 223, 283-292 (1996).
51. R. G. Palmer, D. L. Stein, E. Abrahams, and P. W. Anderson, Models of Hierarchically Constrained Dynamics for Glassy Relaxation, Phys. Rev. Lett. 53, 958-961 (1984).
52. Modern Heuristic Search Methods, Eds. V. J. Rayward-Smith, I. H. Osman, and C. R. Reeves (Wiley, New York, 1996).
53. Modern Heuristic Techniques for Combinatorial Problems, Ed. C. R. Reeves (Wiley, New York, 1993).
54. G. B. Sorkin, Efficient Simulated Annealing on Fractal Energy Landscapes, Algorithmica 6,367-418 (1991).
55. D. E. Vaughan and S. H. Jacobson, Nonstationary Markov Chain Analysis of Simultaneous Generalized Hill Climbing Algorithms, (submitted), available at http://filebox.vt.edu/users/dvaughn/pdf_powerpoint/sghc2.pdf.
56. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Ed. S. Voss (Kluwer, Dordrecht, 1998).
57. I. Wegener, Theoretical aspects of evolutionary algorithms, Lecture Notes in Computer Science 2076, 64-78 (2001).