Examining the Effect of Elitism in Cellular Genetic Algorithms Using Two Neighborhood Structures

Elitism has a large effect on the search ability of evolutionary algorithms. Many studies, however, did not discuss its different implementations in cellular algorithms. Usually a replacement policy called "replace-if-better" is applied to each cell in cellular algorithms as a kind of elitism. In this paper, we examine three implementations of elitism. One is global elitism where a prespecified number of the best individuals in the entire population are viewed as being the elite. The replace-if-better policy is applied only to the globally best individuals. Another scheme is local elitism where an individual is viewed as being the elite if it is the best among its neighbors. The replace-if-better policy is applied only to the locally best individuals. The other scheme is cell-wise elitism where the replace-if-better policy is applied to all individuals. Effects of elitism are examined through computational experiments using a cellular genetic algorithm with two neighborhood structures. One is for local competition among neighbors. This competition neighborhood is used in the local elitism to determine the locally best individuals. The other is for local selection of parents. This selection neighborhood is also called the mating neighborhood. Since we have the two neighborhood structures, we can specify the size of the competition neighborhood for the implementation of the local elitism independent of the selection neighborhood for mating. Experimental results show that the use of the replace-if-better policy at all cells is not always the best choice.

[1]  Edmund K. Burke,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[2]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[3]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[4]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[5]  Martina Gorges-Schleuter A Comparative Study of Global and Local Selection in Evolution Strategies , 1998, PPSN.

[6]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[7]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[8]  Enrique Alba,et al.  The exploration/exploitation tradeoff in dynamic cellular genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[9]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[10]  Bernard Manderick,et al.  A Massively Parallel Genetic Algorithm: Implementation and First Analysis , 1991, ICGA.

[11]  Hisao Ishibuchi,et al.  Evolution of iterated prisoner's dilemma game strategies in structured demes under random pairing in game playing , 2005, IEEE Transactions on Evolutionary Computation.

[12]  Enrique Alba,et al.  Selection intensity in cellular evolutionary algorithms for regular lattices , 2005, IEEE Transactions on Evolutionary Computation.

[13]  Jens Jägersküpper,et al.  How Comma Selection Helps with the Escape from Local Optima , 2006, PPSN.

[14]  D. Wilson Structured Demes and the Evolution of Group-Advantageous Traits , 1977, The American Naturalist.

[15]  Kenneth A. De Jong,et al.  An Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm , 1997, ICGA.

[16]  Margarita Ifti,et al.  Effects of neighbourhood size and connectivity on the spatial Continuous Prisoner's Dilemma. , 2004, Journal of theoretical biology.

[17]  Enrique Alba,et al.  Cellular Evolutionary Algorithms: Evaluating the Influence of Ratio , 2000, PPSN.

[18]  Kenneth A. De Jong,et al.  An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms , 1996, PPSN.

[19]  David Sloan Wilson,et al.  Structured Demes and Trait-Group Variation , 1979, The American Naturalist.

[20]  M Slatkin,et al.  Coevolution in structured demes. , 1979, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[22]  L. Darrell Whitley,et al.  Cellular Genetic Algorithms , 1993, ICGA.

[23]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[24]  Brian Charlesworth,et al.  A Note on the Evolution of Altruism in Structured Demes , 1979, The American Naturalist.

[25]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

[26]  Hisao Ishibuchi,et al.  Effects of Using Two Neighborhood Structures in Cellular Genetic Algorithms for Function Optimization , 2006, PPSN.