Abstract
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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alba, E., Dorronsoro, B.: The Exploration/Exploitation Tradeoff in Dynamic Cellular Genetic Algorithms. IEEE Trans. on Evolutionary Computation 9, 126–142 (2005)
Alba, E., Tomassini, M.: Parallelism and Evolutionary Algorithms. IEEE Trans. on Evolutionary Computation 6, 443–462 (2002)
Cantu-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Springer, Berlin (2000)
Charlesworth, B.: A Note on the Evolution of Altruism in Structured Demes. The American Naturalist 113, 601–605 (1979)
Giacobini, M., Tomassini, M., Tettamanzi, A.G.B., Alba, E.: Selection Intensity in Cellular Evolutionary Algorithms for Regular Lattices. IEEE Trans. on Evolutionary Computation 9, 489–505 (2005)
Gorges-Schleuter, M.: ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy. In: Proc. of 3rd International Conference on Genetic Algorithms, pp. 422–427 (1989)
Gorges-Schleuter, M.: A Comparative Study on Global and Local Selection in Evolutionary Strategies. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 367–377. Springer, Heidelberg (1998)
Ifti, M., Killingback, T., Doebelic, M.: Effects of Neighborhood Size and Connectivity on the Spatial Continuous Prisoner’s Dilemma. Journal of Theoretical Biology 231, 97–106 (2004)
Ishibuchi, H., Namikawa, N.: Evolution of Iterated Prisoner’s Dilemma Game Strategies in Structured Demes under Random Pairing in Game Playing. IEEE Trans. on Evolutionary Computation 9, 552–561 (2005)
Ishibuchi, H., Namikawa, N.: Evolution of Cooperative Behavior in the Iterated Prisoner’s Dilemma under Random Pairing in Game Playing. In: Proc. of 2005 Congress on Evolutionary Computation, pp. 2637–2644 (2005)
Ishibuchi, H., Namikawa, N., Ohara, K.: Effects of Spatial Structures on Evolution of Iterated Prisoner’s Dilemma Game Strategies in Single-Dimensional and Two-Dimensional Grids. In: Proc. of 2006 Congress on Evolutionary Computation (in press, 2006)
Manderick, B., Spiessens, P.: Fine-Grained Parallel Genetic Algorithms. In: Proc. of 3rd International Conference on Genetic Algorithms, pp. 428–433 (1989)
Sarma, J., De Jong, K.: An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 236–244. Springer, Heidelberg (1996)
Sarma, J., De Jong, K.: An Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm. In: Proc. of 7th International Conference on Genetic Algorithms, pp. 181–186 (1997)
Slatkin, M., Wilson, D.S.: Coevolution in Structured Demes. Proc. of the National Academy of Sciences, 76, 2084–2087 (1979)
Spiessens, P., Manderick, B.: A Massively Parallel Genetic Algorithm: Implementation and First Analysis. In: Proc. of 4th International Conference on Genetic Algorithms, pp. 279–286 (1991)
Whitley, D.: Cellular Genetic Algorithms. In: Proc. of 5th International Conference on Genetic Algorithms, p. 658 (1993)
Wilson, D.S.: Structured Demes and the Evolution of Group-Advantageous Traits. The American Naturalist 111, 157–185 (1977)
Wilson, D.S.: Structured Demes and Trait-Group Variation. The American Naturalist 113, 606–610 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishibuchi, H., Doi, T., Nojima, Y. (2006). Effects of Using Two Neighborhood Structures in Cellular Genetic Algorithms for Function Optimization. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_96
Download citation
DOI: https://doi.org/10.1007/11844297_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)