Symmetry Breaking in Population-Based Optimization

IEEE Transactions on Evolutionary Computation

Volumn 8, Issue 1, 2004, Pages 63-79

  Prügel Bennett, Adam ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Crossover; Diffusion equations; Evolutionary algorithms (EAs); Landscapes; Replica symmetry; Symmetry breaking

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; DIFFERENCE EQUATIONS; ESTIMATION; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

CROSSOVER; DIFFUSION EQUATION; LANDSCAPES; REPLICA SYMMETRY; SYMMETRY BREAKING;

POPULATION STATISTICS;

EID: 1542273616     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2003.819419     Document Type: Article

References (39)

1. J. L. Shapiro and A. Prügel-Bennett, "Genetic algorithms dynamics in two-well potentials with basins and barriers," in Foundations of Genetic Algorithm 4, R. K. Belew and M. D. Vose, Eds. San Mateo, CA: Morgan Kaufmann, 1997, pp. 101-116.
2. A. Rogers and A. Prügel-Bennett, "The dynamics of a genetic algorithm on a model hard optimization problem," Complex Syst., vol. 11, no. 6, pp. 437-464, 2000.
3. _, "A solvable model of a hard optimization problem," in Theoretical Aspects of Evolutionary Computing, L. Kallel, B. Naudts, and A. Rogers, Eds. Berlin, Germany: Springer, 2001, Natural Computing, pp. 207-221.
4. T. Jansen and I. Wegener, "On the analysis of evolutionary algorithms-a proof that crossover can really help," in Proc. 7th Annu. European Symp. Algorithms (ESA'99), J. Nesetril, Ed., 1999, pp. 184-193.
5. A. Prügel-Bennett, "When a genetic algorithm outperforms hill-climbing," J. Theoretical Comput. Sci., 2001, submitted for publication.
6. T. Jansen and I. Wegener, "Real royal road functions - where crossover provably is essential," in GECCO. San Mateo, CA: Morgan Kaufmann, 2001, pp. 1034-1041.
7. A. Prügel-Bennett and J. L. Shapiro, "The dynamics of a genetic algorithm for simple random Ising systems," Physica D, vol. 104, pp. 75-114, 1997.
8. P. Galinier and J. K. Hao, "Hybrid evolutionary algorithms for graph coloring,"J. Combinatorial Opt., vol. 3, no. 4, pp. 379-397, 1999.
9. C. A. Glass and A. Prügel-Bennett, "Genetic algorithms for graph coloring: exploration of Galinier and Hao's algorithm," J. Combinatorial Opt., vol. 7, pp. 229-236, Sept. 2003.
10. N. J. Radcliffe, "Genetic set recombination and its application to neural network topology optimization," Neural Comput. Appli., vol. 1, no. 1, pp. 67-90, 1992.
11. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, "Determining computational complexity from characteristic 'phase transisition'," Nature, vol. 400, pp. 133-137, 1999.
12. L. Pitt and L. G. Valiant, "Computational limitations on learning from examples," Comput. Mach., vol. 35, p. 965, 1988.
13. H. Horner, "Dynamics of learning for the binary perceptron problem," Zeitschrift für Physik: B, vol. 86, pp. 291-308, 1992.
14. E. Gardner, "The space of interations in neural network models," J. Phys. A, vol. 21, p. 257, 1988.
15. E. Gardner and B. Derrida, "Optimal storage properties of neural network models," J. Phys. A, vol. 21, p. 271, 1988.
16. W. Krauth and M. Mézard, "Storage capacity of memory networks with binary couplings," J. de Physique, vol. 50, pp. 3057-3066, 1989.
17. O. C. Martin, R. Monasson, and R. Zecchina, "Statistical mechanics methods and phase transitions in optimization problems," Theor. Comput. Sci., vol. 265, no. 1-2, pp. 3-67, 2001.
18. M. Mézard, G. Parisi, and R. Zecchina, "Analytic and algorithmic solution of random satisfiability problems," Science, vol. 297, pp. 812-815, 2002.
19. M. Mézard and R. Zecchina, "The random K-satisfiability problem: from an analytic solution to an efficient algorithm," Phys. Rev. E, vol. 66, p. 056126, 2002.
20. L. L. A. Crisanti and G. Parisi, "The 3-Sat problem with large number of cleases in the 30-replica symmetry breaking scheme," J. Physics:A, vol. 35, pp. 481-497, 2002.
21. M. Mézard, G. Parisi, and M. A. Virasoro, Spin-Class Theory and Beyond, Singapore: World Scientific, 1987, vol. 9. Lecture Notes in Physics.
22. P. Stadler, "Spectral landscape theory," in Evolutionary Dynamics-Exploring the Interplay of Selection, Neutrality, Accident and Function, J. Crutchfield and P. Schuster, Eds. Oxford, U.K.: Oxford Univ. Press.
23. C. Flamm, I. L. Hofacker, P. F. Stadler, and M. T. Wolfinger, "Barrier trees of degenerate landscapes," Z. Phys. Chem., vol. 216, pp. 155-173, 2002.
24. C. M. Reidys and P. F. Stadler, "Combinatorial landscapes," SIAM Rev., vol. 44, pp. 3-54, 2002.
25. J. Hallam and A. Prügel-Bennett, "Barrier trees for search analysis," in GECCO 2003, 2003, pp. 1586-1587.
26. A. Prügel-Bennett, "Finite population effects for ranking and tournament selection," Complex Syst., vol. 12, no. 2, pp. 183-205, 2000.
27. R. A. Fisher, "On the dominance ratio," in Proc. Roy. Soc. Edin., vol. 42, 1922, pp. 321-341.
28. _, "The distribution of gene ratios for rare mutations," in Proc. Roy. Soc. Edin., vol. 50, 1930, pp. 205-220.
29. S. Wright, "Evolution in Mendelian populations," Genetics, no. 24, pp. 97-159, 1931.
30. M. Kimura and N. Takahata, Population Genetics, Molecular Evolution, and Nutral Theory: Selected Papers of Motoo Kimura, 1st ed. Chicago, IL: Univ. of Chicago Press, 1994.
31. J. F. Crow and M. Kimura, An Introduction to Population Genetics Theory. New York: Harper & Row, 1970.
32. W. J. Ewens, Mathematical Population Genetics. Berlin, Germany: Springer-Verlag, 1979.
33. B. Øksendal, Stochastic Differential Equations. Berlin, Germany: Springer-Verlag, 1985.
34. M. Kimura, "Diffusion models in population genetics," J. Appl. Probability, vol. 1, pp. 177-232, 1964.
35. R. Durrett, Probability Models for DNA Sequence Evolution. Probability and Its Applications, 1st ed. New York: Springer-Verlag, 2002.
36. M. Kimura and T. Ohta, "The average number of generations until fixation of a mutant gene in a finite population," Genetics, vol. 61, pp. 763-771, 1968.
37. W. B. Provine, Sewall Wright and Evolutionary Biology. Chicago, IL: Univ. of Chicago Press, 1986.
38. J. A. Coyne, N. H. Barton, and M. Turelli, "Perspective: a critique of Sewall Wright's shifting balance theory of evolution," Evolution, vol. 71, pp. 643-671, 1997.
39. E. Cantú-Paz, Efficient and Accurate Parallel Genetic Algorithms, 1st ed. Norwell, MA: Kluwer, 2000, vol. 1, Genetic Algorithms and Evolutionary Computation.