Modeling selection intensity for toroidal cellular evolutionary algorithms

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

Volumn 3102, Issue , 2004, Pages 1138-1149

  Giacobini, Mario ^a   Alba, Enrique ^b   Tettamanzi, Andrea ^c   Tomassini, Marco ^a  

^a UNIVERSITY OF LAUSANNE   (Switzerland)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIFFERENCE EQUATIONS;

CELLULAR EVOLUTIONARY ALGORITHMS; EXPERIMENTAL VALUES; MODEL SELECTION; QUANTITATIVE MODELS; REGULAR LATTICE; SELECTION INTENSITY; SELECTION PRESSURES;

EVOLUTIONARY ALGORITHMS;

EID: 35048857842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_111     Document Type: Article

References (10)

1. M. Giacobini, E. Alba, and M. Tomassini. Selection intensity in asynchronous cellular evolutionary algorithms. In E. Cantú-Paz et al., editor, Proceedings of the genetic and evolutionary computation conference GECCO'03, pages 955-966. Springer Verlag, Berlin, 2003.
2. M. Giacobini, M. Tomassini, and A. Tettamanzi. Modelling selection intensity for linear cellular evolutionary algorithms. In P. Liardet et al., editor, Proceedings of the Sixth International Conference on Artificial Evolution, Evolution Artificielle 2003. Springer Verlag, Berlin, 2003. To appear.
3. D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms, pages 69-93. Morgan Kaufmann, 1991.
4. M. Gorges-Schleuter. An analysis of local selection in evolution strategies. In W. Banzhaf, J. Daida, A. E. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. Smith, editors, Genetic and evolutionary conference, GECCO99, volume 1, pages 847-854. Morgan Kaufmann, San Francisco, CA, 1999.
5. H. Mühlenbein and R. Höns. Stochastic analysis of cellular automata with application to the voter model. Advances in Complex Systems, 5(2 & 3):301-337, 2002.
6. G. Rudolph. On takeover times in spatially structured populations: Array and ring. In K. K. Lai et al., editor, Proceedings of the Second Asia-Pacific Conference on Genetic Algorithms and Applications, pages 144-151. Global-Link Publishing Company, 2000.
7. G. Rudolph and J. Sprave. A cellular genetic algorithm with self-adjusting acceptance thereshold. In First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pages 365-372, London, 1995. IEE.
8. J. Sarma and K. A. De Jong. An analysis of the effect of the neighborhood size and shape on local selection algorithms. In H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel, editors, Parallel Problem Solving from Nature (PPSN IV), volume 1141 of Lecture Notes in Computer Science, pages 236-244. Springer-Verlag, Heidelberg, 1996.
9. J. Sarma and K. A. De Jong. An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In T. Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 181-186. Morgan Kaufmann, 1997.
10. B. Schönfisch and À. de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51:123-143, 1999.