Coarse-graining in genetic algorithms: Some issues and examples

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

Volumn 2723, Issue , 2003, Pages 874-885

  Contreras, Andrés Aguilar ^a   Rowe, Jonathan E ^b   Stephens, Christopher R ^c  

^a IIMAS UNAM   (Mexico)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c INSTITUTO DE CIENCIAS NUCLEARES   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; GENETIC ALGORITHMS;

COARSE GRAINED DYNAMICS; COARSE GRAINING; EIGEN-MODEL; GENERALISATION; GENETIC SYSTEMS; GENOTYPE-PHENOTYPE MAPPING; LINKAGE DISEQUILIBRIUM;

EVOLUTIONARY ALGORITHMS;

EID: 33750226044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_100     Document Type: Article

References (14)

1. Eigen, M. (1971). Self-organization of matter and the evolution of biological macromolecules. Naturwissenschften, 58:465.
2. Geiringer, H. (1944). On the probability theory of linkage in Mendelian heredity. Annals of Mathematical Statistics, 15(1):25-57.
3. Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan.
4. Radcliffe, N. J. (1992). The algebra of genetic algorithms. Anals of Mathematics and Artificial Intelligence, 10:339-384.
5. Reeves, C. R. and Rowe, J. E. (2001). Genetic Algorithms - Principles and Perspectives, chapter 6, The Dynamical Systems Model. Kluwer Academic Publishers.
6. 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.
7. Stadler, P. F. and Stephens, C. R. (2003). Landscapes and effective fitness. Comm. Theor. Biol. Accepted for publication.
8. 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.
9. Stephens, C. R. (2003). The renormalization group and the dynamics of genetic systems. Acta Phys. Slov., 52:515-524.
10. 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.
11. van Nimwegen, E., Crutchfield, J. P., and Mitchell, M. (1997). Finite populations induce metastability in evolutionary search. Physics Letters A, 229:144-150.
12. Vose, M. D. (1991). Generalizing the notion of a schema in genetic algorithms. Artificial Intelligence, 50:385-396.
13. Vose, M. D. (1999). The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA.
14. Vose, M. D. and Wright, A. H. (2001). Form invariance and implicit parallelism. Evolutionary Computation, 9(3):355-370.