DocumentCode :
1181067
Title :
Selection intensity in cellular evolutionary algorithms for regular lattices
Author :
Giacobini, Mario ; Tomassini, Marco ; Tettamanzi, Andrea G B ; Alba, Enrique
Author_Institution :
Inf. Syst. Dept., Univ. of Lausanne, Dorigny-Lausanne, Switzerland
Volume :
9
Issue :
5
fYear :
2005
Firstpage :
489
Lastpage :
505
Abstract :
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 controlled 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.
Keywords :
cellular automata; difference equations; lattice theory; polynomial approximation; probabilistic automata; asynchronous cell update policies; binary tournament; cellular evolutionary algorithm; linear ranking; polynomial approximation; probabilistic difference equations; regular lattices; selection intensity; Convergence; Difference equations; Evolutionary computation; Hardware; Lattices; Logistics; Mathematical model; Polynomials; Topology; Two dimensional displays; Asynchronous dynamics; cellular evolutionary algorithms (cEAs); regular lattices; selection intensity; synchronous dynamics;
fLanguage :
English
Journal_Title :
Evolutionary Computation, IEEE Transactions on
Publisher :
ieee
ISSN :
1089-778X
Type :
jour
DOI :
10.1109/TEVC.2005.850298
Filename :
1514473
Link To Document :
بازگشت