By Topic

Selection intensity in cellular evolutionary algorithms for regular lattices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Giacobini, M. ; Inf. Syst. Dept., Univ. of Lausanne, Dorigny-Lausanne, Switzerland ; Tomassini, M. ; Tettamanzi, A.G.B. ; Alba, E.

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.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:9 ,  Issue: 5 )