Abstract
Using an exact coarse-grained formulation of the dynamics of a GA we investigate in the context of a tunable family of “modular” fitness landscapes under what circumstances one would expect recombination to be “useful”. We show that this depends not only on the fitness landscape and the state of the population but also on the particular crossover mask under consideration. We conclude that rather than ask when recombination is useful or not one needs to ask - what crossover masks are useful. We show that the answer to this is when the natural “building blocks” of the landscape are compatible with the “building blocks” defined by the crossover mask.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, MA (1993)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA (1989)
Vose, M.D.: The simple genetic algorithm: Foundations and theory. MIT Press, Cambridge, MA (1999)
Mitchell, M., Forrest, S., Holland, J.H.: The royal road for genetic algorithms: Fitness landscapes and ga performance. In: Varela, F.J., Bourgine, P. (eds.) Proceedings of the First European Conference on Artificial Life, pp. 243–254. MIT Press, Cambridge, MA (1992)
Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hypothesis. In: Whitley, L.D. (ed.) Foundations of genetic algorithms, vol. 2, pp. 109–126. Morgan Kaufmann, San Mateo (1993)
Jansen, T., Wegener, I.: Real royal road functionswhere crossover provably is essential. Discrete Applied Mathematics 149(1-3), 111–125 (2005)
Watson, R.A.: Analysis of recombinative algorithms on a non-separable building-block problem. In: Foundations of Genetic Algorithms, pp. 69–89. Morgan Kaufmann, San Mateo (2001)
Stephens, C.R., Waelbroeck, H.: Schemata evolution and building blocks. Evol. Comp. 7, 109–124 (1999)
Stephens, C.R.: Some exact results from a coarse grained formulation of genetic dynamics. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), July 7-11, 2001, pp. 631–638. Morgan Kaufmann, San Francisco, California, USA (2001)
Stephens, C.R., Waelbroeck, H., Aguirre, R.: Schemata as building blocks: Does size matter? In: FOGA, pp. 117–133 (1998)
Beyer, H.-G.: An alternative explanation for the manner in which genetic algorithms operate. BioSystems 41(1), 1–15 (1997)
Jones, T.: Crossover, macromutation, and population-based search. In: Eshelman, L.J. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 73–80. Morgan Kaufmann, San Francisco, CA (1995)
Grefenstette, J.J.: Deception considered harmful. In: Foundations of Genetic Algorithms, pp. 75–91. Morgan Kaufmann, San Mateo (1992)
Harik, G.R., Goldberg, D.G.: Learning linkage. In: FOGA , vol. 4, pp. 247–262 (1996)
Stephens, C.R.: The renormalization group and the dynamics of genetic systems. Acta Phys. Slov. 52, 515–524 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stephens, C.R., Cervantes, J. (2007). Just What Are Building Blocks?. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds) Foundations of Genetic Algorithms. FOGA 2007. Lecture Notes in Computer Science, vol 4436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73482-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-73482-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73479-6
Online ISBN: 978-3-540-73482-6
eBook Packages: Computer ScienceComputer Science (R0)