A building-block royal road where crossover is provably essential

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 1452-1459

  Watson, Richard A ^a   Jansen, Thomas ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Building block hypothesis; Crossover; Genetic algorithms theory; Modularity; Mutation; Royal roads

Indexed keywords

COMPUTATIONAL EFFICIENCY; FUNCTION EVALUATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BUILDING BLOCK HYPOTHESIS; CROSSOVER; MODULARITY; MUTATION;

GENETIC ALGORITHMS;

EID: 34548073100     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277224     Document Type: Conference Paper

References (30)

1. J. C. Culberson, "Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions", Evolutionary Computation 2, 279 (1995).
2. K. Deb, D. E. Goldberg. "Analyzing Deception in Trap Functions", in D. Whitley, Ed. Foundations of Genetic Algorithms 2, (Morgan Kaufmann, San Mateo, CA, 1992) pp. 93-108.
3. K. Deb, D. E. Goldberg, "Sufficient Conditions for Deceptive and Easy Binary Functions", Annals of Mathematics and Artificial Intelligence 10, 385 (1992).
4. M. Dietzfelbinger, B. Naudts, C. van Hoyweghen, I. Wegener, "The analysis of a recombinative hill-climber on H-IFF", IEEE-Trans. on Evolutionary Computation 7, 417 (2002).
5. S. Droste, T. Jansen, I. Wegener, "On the analysis of the (1+1) evolutionary algorithm", Theoretical Computer Science, 276, 51. (2002)
6. S. Forrest, M. Mitchell, "Relative Building-block fitness and the Building-block Hypothesis", in D. Whitley, Ed., Foundations of Genetic Algorithms 2, (Morgan Kaufmann, San Mateo, CA, 1993), pp. 109-126.
7. S. Forrest, M. Mitchell, "What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation", Machine Learning 13(2), 285 (1993).
8. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading, MA, 1989).
9. G. Harik, D. E. Goldberg, "Learning Linkage", in R. K. Belew, M. D. Vose, Eds. Foundations of Genetic Algorithms 4 (Morgan Kaufmann, San Francisco, 1997), pp. 247-262.
10. J. H. Holland, Adaptation in Natural and Artificial Systems (Ann Arbor, MI: Univ. Michigan Press, 1975).
11. J. H. Holland, "Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions", Evolutionary Computation 8, 373 (2000).
12. C. Igel, M. Toussaint, "A no-free-lunch theorem for nonuniform distributions of target functions", Journal of Mathematical Modeling and Algorithms, 3(4), 313 (2004).
13. T. Jansen, I. Wegener, "Real royal road functions - where crossover provably is essential", Discrete Applied Mathematics 149, 111 (2005).
14. T. Jones, Evolutionary Algorithms, Fitness Landscapes and Search, PhD dissertation, 95-05-048, University of New Mexico, Albuquerque (1995).
15. S. Kauffman, S. Levin, "Towards a general theory of adaptive walks on rugged landscapes", J. Theor. Biol. 128, 11 (1987).
16. V. Kvasnicka, "An Evolutionary Model of Symbiosis", Studies in Fuzziness and Soft Computing, 54, 293 (2000).
17. M. Mitchell, S. Forrest, J. H. Holland, "The royal road for genetic algorithms: Fitness landscapes and GA performance", in F. J. Varela, P. Bourgine Eds., Procs. of first European Conference on Artificial Life, (MIT Press, Cambridge, MA, 1992) pp. 245-254.
18. R. Motwani, P. Raghavan. Randomized Algorithms. (Cambridge Univ. Press, 1995).
19. M. Pelikan, Bayesian Optimization Algorithm: From Single Level to Hierarchy, Ph.D. Dissertation, Dept. of Computer Science at the University of Illinois at Urbana-Champaign (2002).
20. M. A. Potter, K. A. De Jong, "Cooperative Co-evolution: An Architecture for Evolving Coadapted Subcomponents", Evolutionary Computation, 8(1), 1 (2000).
21. A. Rogers, A. Prügel-Bennett, "A Solvable Model of a Hard Optimisation Problem", in L. Kallel, B.Naudts, A.Rogers, Eds. Procs. of Theoretical Aspects of Evolutionary Computing (Springer, Berlin, 2001), pp. 207-221.
22. J.L. Shapiro, A. Prügel-Bennett, "Genetic algorithm dynamics in two-well potentials with basins and barrier", in Foundations of Genetic Algorithms 4, R. K. Belew, M. D. Vose, Eds. (Morgan Kaufmann, San Francisco, 1997), pp. 101-116.
23. W. M. Spears, "Crossover or Mutation?", in D. Whitley, Ed. Foundations of Genetic Algorithms 2, (Morgan Kaufmann, San Mateo, CA, 1992), pp. 221-237.
24. M. D. Vose, G. E. Liepins,. "Schema disruption", in Procs. of the Fourth International Conference on Genetic Algorithms, (Morgan Kaufmann: San Mateo, 1991), pp. 237-243.
25. M. D. Vose, A. H. Wright, "The Simple Genetic Algorithm and the Walsh Transform: part I, Theory", Evolutionary Computation, 6(3), 253 (1998).
26. R. A. Watson, "A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover", in X. Yao et al. Eds. Parallel Problem Solving from Nature - PPSN VIII, (Springer, Berlin, 2004), pp. 161-171.
27. R. A. Watson, "Analysis of Recombinative Algorithms on a Non-Separable Building-Block Problem", in W.N. Martin, W.M. Spears, Eds. Foundation of Genetic Algorithms 6, (Morgan Kaufmann, San Francisco, 2001) pp. 69-89.
28. R. A. Watson, "On the Unit of Selection in Sexual Populations", in Advances in Artificial Life, Eighth European Conference (ECAL 2005) (Springer, Berlin, 2005), pp. 895-905.
29. R. A. Watson, D. Weinreich, J. Wakeley, "Sex avoids intragenic local optima that trap asexuals", in prep.
30. J. B. Wolf, E. D. Brodie III, M. J. Wade, Epistasis and the Evolutionary Process. (Oxford University Press: New York, 2000).