Abstract
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, giving as examples schemata, genotype-phenotype mappings, and error classes in the Eigen model. We discuss how the dynamics transforms under a coarse-graining, comparing and contrasting different notions of invariance. We work out some examples in the two-bit case, to illustrate the ideas and issues. We then find a bound for the Selection Weighted Linkage Disequilibrium Coefficient for the two-bit onemax problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eigen, M. (1971). Self-organization of matter and the evolution of biological macromolecules. Naturwissenschften, 58:465.
Geiringer, H. (1944). On the probability theory of linkage in Mendelian heredity. Annals of Mathematical Statistics, 15(1):25–57.
Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan.
Radcliffe, N. J. (1992). The algebra of genetic algorithms. Anals of Mathematics and Artificial Intelligence, 10:339–384.
Reeves, C. R. and Rowe, J. E. (2001). Genetic Algorithms—Principles and Perspectives, chapter 6, The Dynamical Systems Model. Kluwer Academic Publishers.
Rowe, J. (1998). Population fixed-points for functions of unitation. In Banzhaf, W. and Reeves, C., editors, Foundations of Genetic Algorithms, pages 69–84. Morgan Kaufmann.
Stadler, P. F. and Stephens, C. R. (2003). Landscapes and effective fitness. Comm. Theor. Biol. Accepted for publication.
Stephens, C. R. (2001). Some exact results from a coarse grained formulation of genetic dynamics. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 631–638, San Francisco, California, USA. Morgan Kaufmann.
Stephens, C. R. (2003). The renormalization group and the dynamics of genetic systems. Acta Phys. Slov., 52:515–524.
Stephens, C. R. and Waelbroek, H. (1997). Effective degrees of freedom in genetic algotithms and the block hypothesis. In Bäck, T., editor, Proceedings of the Seventh International Conference on Genetic Algotithms, pages 34–41. Morgan Kauffman.
van Nimwegen, E., Crutchfield, J. P., and Mitchell, M. (1997). Finite populations induce metastability in evolutionary search. Physics Letters A, 229:144–150.
Vose, M. D. (1991). Generalizing the notion of a schema in genetic algorithms. Artificial Intelligence, 50:385–396.
Vose, M. D. (1999). The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA.
Vose, M. D. and Wright, A. H. (2001). Form invariance and implicit parallelism. Evolutionary Computation, 9(3):355–370.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Contreras, A.A., Rowe, J.E., Stephens, C.R. (2003). Coarse-Graining in Genetic Algorithms: Some Issues and Examples. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_100
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive