Effects of Using Two Neighborhood Structures in Cellular Genetic Algorithms for Function Optimization

We implement a cellular genetic algorithm with two neighborhood structures following the concept of structured demes: One is for interaction among individuals and the other is for mating. The effect of using these two neighborhood structures on the search ability of cellular genetic algorithms is examined through computational experiments on function optimization problems. Experimental results show that good results are obtained from the combination of a small interaction neighborhood and a large mating neighborhood. This relation in the size of the two neighborhood structures coincides with many cases of biological evolution in nature such as plants and territorial animals. It is also shown that the search ability of cellular genetic algorithms is deteriorated by the opposite combination of the two neighborhood structures.

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

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

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

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

[5]  Hisao Ishibuchi,et al.  Effects of Spatial Structures on Evolution of Iterated Prisoner’s Dilemma Game Strategies in Single-Dimensional and Two-Dimensional Grids , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[7]  Hisao Ishibuchi,et al.  Evolution of cooperative behavior in the iterated prisoner's dilemma under random pairing in game playing , 2005, 2005 IEEE Congress on Evolutionary Computation.

[8]  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.

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

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

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

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

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

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

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

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

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

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

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

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

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