Abstract
We present quantitative models for the selection pressure on cellular evolutionary algorithms structured as a ring of cells. We obtain results for synchronous and asynchronous cell update policies. Theoretical results are in agreement with experimental values and show that the selection intensity can be controlled by using different update methods.
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
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, The MIT Press, Cambridge (1997)
Sarma, J., Jong, K.A.D.: An analysis of the effect of the neighborhood size and shape on local selection algorithms. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 236–244. Springer, Heidelberg (1996)
Sarma, J., Jong, K.A.D.: An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In: Bäck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 181–186. Morgan Kaufmann, San Francisco (1997)
Rudolph, G., Sprave, J.: A cellular genetic algorithm with self-adjusting acceptance thereshold. In: First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pp. 365–372. IEEE, London (1995)
Giacobini, M., Alba, E., Tomassini, M.: Selection intensity in asynchronous cellular evolutionary algorithms. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 955–966. Springer, Heidelberg (2003)
Sprave, J.: A unified model of non-panmictic population structures in evolutionary algorithms. In: Congress on Evolutionary Computation (CEC 1999), pp. 1384–1391. IEEE Press, Piscataway (1999)
Gorges-Schleuter, M.: An analysis of local selection in evolution strategies. In: Genetic and evolutionary conference, GECCO 1999, vol. 1, pp. 847–854. Morgan Kaufmann, San Francisco (1999)
Rudolph, G.: On takeover times in spatially structured populations: Array and ring. In: Lai, K., et al. (eds.) Proceedings of the Second Asia-Pacific Conference on Genetic Algorithms and Applications, pp. 144–151. Global-Link Publishing Company (2000)
Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51, 123–143 (1999)
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, pp. 69–93. Morgan Kaufmann, San Francisco (1991)
Durrett, R.: Lecture Notes on Particle Systems and Percolation. Wadsworth, Belmont, CA (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giacobini, M., Tomassini, M., Tettamanzi, A. (2004). Modeling Selection Intensity for Linear Cellular Evolutionary Algorithms. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2003. Lecture Notes in Computer Science, vol 2936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24621-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24621-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21523-3
Online ISBN: 978-3-540-24621-3
eBook Packages: Springer Book Archive