Takeover time curves in random and small-world structured populations
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Using pair approximations to predict takeover dynamics in spatially structured populations
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Takeover times on scale-free topologies
Proceedings of the 9th annual conference on Genetic and evolutionary computation
An analysis of the effects of population structure on scalable multiobjective optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary dynamics for the spatial Moran process
Genetic Programming and Evolvable Machines
Parameterizing pair approximations for takeover dynamics
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
The influence of scaling and assortativity on takeover times in scale-free topologies
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Examining the Effect of Elitism in Cellular Genetic Algorithms Using Two Neighborhood Structures
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Evolvable Agents in Static and Dynamic Optimization Problems
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Use of Local Ranking in Cellular Genetic Algorithms with Two Neighborhood Structures
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Pair approximations of takeover dynamics in regular population structures
Evolutionary Computation
Centric selection: a way to tune the exploration/exploitation trade-off
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolutionary dynamics on scale-free interaction networks
IEEE Transactions on Evolutionary Computation
Distributed differential evolution with explorative---exploitative population families
Genetic Programming and Evolvable Machines
Multiobjective evolutionary algorithms on complex networks
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
An overview of AI research in Italy
Artificial intelligence
EvAg: a scalable peer-to-peer evolutionary algorithm
Genetic Programming and Evolvable Machines
Effect of topology on diversity of spatially-structured evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Evolutionary dynamics on graphs: the moran process
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Sexual recombination in self-organizing interaction networks
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Hierarchical cellular genetic algorithm
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Dynamic Fault-Tolerant three-dimensional cellular genetic algorithms
Journal of Parallel and Distributed Computing
An analysis of a spatial EA parallel boosting algorithm
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
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.