Simple genetic algorithms on populations of l-binary words usually become iterative systems on 2l dimensional spaces when populations have size infinite. However, in a particular model (BCCG model) previously introduced, it has been shown that the iterative system works in a l-dimensional space. In this paper we propose a simplification of the BCCG model and we analyze it in the case of large but finite-size populations. In particular: 1. We exhibit a Markov chain with states in IRl that approximates the system behavior. 2. We estimate the steady state distribution of the Markov chain. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bertoni, A., Campadelli, P., & Posenato, R. (2005). Analysis of a genetic model with finite populations. In Lecture Notes in Computer Science (Vol. 3612, pp. 235–244). Springer Verlag. https://doi.org/10.1007/11539902_28
Mendeley helps you to discover research relevant for your work.