A new method for modeling the behavior of finite population evolutionary algorithms.
As practitioners we are interested in the likelihood of the population containing a copy of the optimum. The dynamic systems approach, however, does not help us to calculate that quantity. Markov chain analysis can be used in principle to calculate the quantity. However, since the associated transition matrices are enormous even for modest problems, it follows that in practice these calculations are usually computationally infeasible. Therefore, some improvements on this situation are desirable. In this paper, we present a method for modeling the behavior of finite population evolutionary algorithms (EAs), and show that if the population size is greater than 1 and much less than the cardinality of the search space, the resulting exact model requires considerably less memory space for theoretically running the stochastic search process of the original EA than the Nix and Vose-style Markov chain model. We also present some approximate models that use still less memory space than the exact model. Furthermore, based on our models, we examine the selection pressure by fitness-proportionate selection, and observe that on average over all population trajectories, there is no such strong bias toward selecting the higher fitness individuals as the fitness landscape suggests.
Motoki
Tatsuya
T
Department of Information Engineering, Niigata University, Ikarashi 2-8050, Niigata 950-2181, Japan. motoki@ie.niigata-u.ac.jp
D000465:Algorithms; D005075:Biological Evolution; D008390:Markov Chains; D015233:Models, Statistical; D011156:Population Density