Selection Intensity in Cellular Evolutionary Algorithms for Regular Lattices

M. Giacobini, M. Tomassini, A.G.B. Tettamanzi, E. Alba
2005 IEEE Transactions on Evolutionary Computation  
In this paper, we present quantitative models for the selection pressure of cellular evolutionary algorithms on regular one-and two-dimensional (2-D) lattices. We derive models based on probabilistic difference equations for synchronous and several asynchronous cell update policies. The models are validated using two customary selection methods: binary tournament and linear ranking. Theoretical results are in agreement with experimental values, showing that the selection intensity can be
more » ... led by using different update methods. It is also seen that the usual logistic approximation breaks down for low-dimensional lattices and should be replaced by a polynomial approximation. The dependence of the models on the neighborhood radius is studied for both topologies. We also derive results for 2-D lattices with variable grid axes ratio.
doi:10.1109/tevc.2005.850298 fatcat:omifly5uhjh3lgwssxy2vtypkq