A simple two-module problem to exemplify building-block assembly under crossover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3242, Issue , 2004, Pages 161-171

  Watson, Richard A ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUILDINGS; GENETIC ALGORITHMS;

BUILDING BLOCKES; FITNESS LANDSCAPE;

PROBLEM SOLVING;

EID: 35048848427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_17     Document Type: Article

References (26)

1. Holland, JH, 1975, Adaptation in Natural and Artificial Systems, Ann Arbor, MI: The University of Michigan Press.
2. Wolpert, D, & Macready, W, 1997, "No Free Lunch Theorems for Optimization", IEEE Transactions on Evolutionary Computation, 1(1):67-82, 1997.
3. Mitchell, M, Holland, JH, & Forrest, S, 1995 "When will a Genetic Algorithm Outperform Hill-climbing?" Advances in Neural Information Processing Systems, 6:51-58, Morgan Kaufmann, CA.
4. Culberson, JC, 1995, "Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions", Evolutionary Computation, 2, pp. 279-311.
5. Muhlenbein, H, 1992, "How genetic algorithms really work: I. mutation and hill-climbing." In Parallel Problem Solving from Nature 2, Manner, R & Manderick, B, (eds), pp. 15-25. Elsevier.
6. Spears, WM, 1992, "Crossover or Mutation?", in Foundations of Genetic Algorithms-2, Whitley, D, (ed.). 221-237.
7. Forrest, S, & Mitchell, M, 1993b, "What makes a problem hard for a Genetic Algorithm? Some anomalous results and their explanation" Machine Learning 13, pp.285-319.
8. Jones, T, 1995, Evolutionary Algorithms, Fitness Landscapes and Search, PhD dissertation, 95-05-048, University of New Mexico, Albuquerque.
9. Holland, JH, 2000, "Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions", Evolutionary Computation 8(4): 373-391.
10. Goldberg, DE, 1989, Genetic Algorithms in Search, Optimization and Machine Learning, Reading Massachusetts, Addison-Wesley.
11. Forrest, S, & Mitchell, M, 1993a, "Relative Building block fitness and the Building block Hypothesis", in Foundations of Genetic Algorithms 2, Whitley, D, ed., Morgan Kaufmann, San Mateo, CA.
12. Rogers, A, & Priigel-Bennett, A, 2001, "A Solvable Model Of A Hard Optimisation Problem", in Procs. of Theoretical Aspects of Evolutionary Computing, eds. Kallel, L, et.al., pp. 207-221.
13. Jansen T., & Wegener, I. (2001) Real Royal Road Functions - Where Crossover Provably is Essential, in Procs. of Genetic and Evolutionary Computation Conference, eds. Spector, L., et. al. (Morgan Kaufmann, San Francisco, CA.), pp. 374-382.
14. Watson, RA, Hornby, GS, & Pollack, JB, 1998, "Modeling Building block Interdependency", Procs. of Parallel Problem Solving from Nature V, eds.Eiben, et. al, Springer, pp. 97-106.
15. Watson, RA, 2001, "Analysis of Recombinative Algorithms on a Non-Separable Building block Problem", Foundations of Genetic Algorithms VI, (2000), eds., Martin WN & Spears WM, Morgan Kaufmann, pp. 69-89.
16. Watson, RA, 2002, Compositional Evolution: Interdisciplinary Investigations in Evolvability, Modularity, and Symbiosis, in Natural and Artificial Evolution, PhD dissertation, Brandeis University, May 2002.
17. Mahfoud, S, 1995, Niching Methods for Genetic Algorithms, PhD thesis, University of Illinois,
18. (also IlliGAl Report No. 95001)
19. Wright, S. (1931) Evolution in Mendelian populations, Genetics. 16, 97-159.
20. Fisher, R.A. (1930) The genetical theory of natural selection (Clarendon Press, Oxford).
21. Syswerda, G, 1989, "Uniform Crossover in Genetic Algorithms", in Proc. Third International Conference on Genetic Algorithms, Schaffer, J. (ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 2-9, 1989.
22. Stadler, P.P., & Wagner, G.P. (1998) "Algebraic theory of recombination spaces", Evolutionary Computation, 5, 241-275.
23. Gitchoff, P, and Wagner, GP, 1996, "Recombination induced hypergraphs: a new approach to mutation-recombination isomorphism", Complexity 2: pp. 37-43.
24. Vosc, MD, The Simple Genetic Algorithm: Foundations and Theory, 1999, Bradford Books.
25. Mitchell, M, Forrest, S, and Holland, JH, 1992, "The royal road for genetic algorithms: Fitness landscapes and GA performance", in Toward a practice of autonomous systems, Proceedings of the First European Conference on Artificial Life. Cambridge, MA: Bradford Books, pp. 245-54.
26. Deb, K, & Goldberg, DE, 1992a, "Analyzing Deception in Trap Functions", in Whitley, D, ed., Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA. pp. 93-108.