Coarse Graining Selection and Mutation
暂无分享,去创建一个
Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained.
[1] Christopher R. Stephens,et al. Schemata Evolution and Building Blocks , 1999, Evolutionary Computation.
[2] Michael D. Vose,et al. The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.
[3] Alden H. Wright,et al. State Aggregation and Population Dynamics in Linear Systems , 2005, Artificial Life.
[4] H. Mühlenbein,et al. Gene Pool Recombination in Genetic Algorithms , 1996 .