Modeling Selection Intensity for Linear Cellular Evolutionary Algorithms

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

Volumn 2936, Issue , 2004, Pages 345-356

  Giacobini, Mario ^a   Tomassini, Marco ^a   Tettamanzi, Andrea ^b  

^a UNIVERSITY OF LAUSANNE   (Switzerland)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

A-RINGS; CELLULAR EVOLUTIONARY ALGORITHMS; EXPERIMENTAL VALUES; MODEL SELECTION; QUANTITATIVE MODELS; SELECTION INTENSITY; SELECTION PRESSURES;

EVOLUTIONARY ALGORITHMS;

EID: 27344434479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24621-3_28     Document Type: Article

References (11)

1. Gorges-Schleuter, M.: On the power of evolutionary optimization at the example of ATSP and large TSP problems. In Husbands, P., Harvey, I., eds.: Fourt European Conference on Artificial Life, Cambridge, Massachusetts, The MIT Press (1997).
2. Sarma, J., Jong, K.A.D.: An analysis of the effect of the neighborhood size and shape on local selection algorithms. In Voigt, H.M., Ebeling, W., Rechenberg, I., Schwefel, H.P., eds.: Parallel Problem Solving from Nature (PPSN IV). Volume 1141 of Lecture Notes in Computer Science., Springer-Verlag, Heidelberg (1996) 236-244.
3. Sarma, J., Jong, K.A.D.: An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In Back, T., ed.: Proceedings of the Seventh International Conference on Genetic Algorithms, Morgan Kaufmann (1997) 181-186.
4. Rudolph, G., Sprave, J.: A cellular genetic algorithm with self-adjusting acceptance thereshold. In: In First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, IEE, London (1995) 365-372.
5. Giacobini, M., Alba, E., Tomassini, M.: Selection intensity in asynchronous cellular evolutionary algorithms. In et al., E.C.P., ed.: Proceedings of the genetic and evolutionary computation conference GECCO'03, Springer Verlag, Berlin (2003) 955-966.
6. Sprave, J.: A unified model of non-panmictic population structures in evolutionary algorithms. In: Congress on Evolutionary Computation (CEC'99), IEEE Press, Piscataway, NJ (1999) 1384-1391.
7. Gorges-Schleuter, M.: An analysis of local selection in evolution strategies. In: Genetic and evolutionary conference, GECCO99. Volume 1., Morgan Kaufmann, San Francisco, CA (1999) 847-854.
8. Rudolph, G.: On takeover times in spatially structured populations: Array and ring. In et al., K.K.L., ed.: Proceedings of the Second Asia-Pacific Conference on Genetic Algorithms and Applications, Global-Link Publishing Company (2000) 144-151.
9. Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51 (1999) 123-143.
10. Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In Rawlins, G.J.E., ed.: Foundations of Genetic Algorithms, Morgan Kaufmann (1991) 69-93.
11. Durrett, R.: Lecture Notes on Particle Systems and Percolation. Wadsworth, Belmont CA (1988).