Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Problem Solving from Nature

PPSN 2006: Parallel Problem Solving from Nature - PPSN IX pp 949–958Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4193))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alba, E., Dorronsoro, B.: The Exploration/Exploitation Tradeoff in Dynamic Cellular Genetic Algorithms. IEEE Trans. on Evolutionary Computation 9, 126–142 (2005)

    Article  Google Scholar 

  2. Alba, E., Tomassini, M.: Parallelism and Evolutionary Algorithms. IEEE Trans. on Evolutionary Computation 6, 443–462 (2002)

    Article  Google Scholar 

  3. Cantu-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Springer, Berlin (2000)

    MATH  Google Scholar 

  4. Charlesworth, B.: A Note on the Evolution of Altruism in Structured Demes. The American Naturalist 113, 601–605 (1979)

    Article  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Gorges-Schleuter, M.: ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy. In: Proc. of 3rd International Conference on Genetic Algorithms, pp. 422–427 (1989)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. 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)

    Article  MathSciNet  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Manderick, B., Spiessens, P.: Fine-Grained Parallel Genetic Algorithms. In: Proc. of 3rd International Conference on Genetic Algorithms, pp. 428–433 (1989)

    Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. 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)

    Google Scholar 

  15. Slatkin, M., Wilson, D.S.: Coevolution in Structured Demes. Proc. of the National Academy of Sciences, 76, 2084–2087 (1979)

    Google Scholar 

  16. 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)

    Google Scholar 

  17. Whitley, D.: Cellular Genetic Algorithms. In: Proc. of 5th International Conference on Genetic Algorithms, p. 658 (1993)

    Google Scholar 

  18. Wilson, D.S.: Structured Demes and the Evolution of Group-Advantageous Traits. The American Naturalist 111, 157–185 (1977)

    Article  Google Scholar 

  19. Wilson, D.S.: Structured Demes and Trait-Group Variation. The American Naturalist 113, 606–610 (1979)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai, Osaka, 599-8531, Japan

    Hisao Ishibuchi, Tsutomu Doi & Yusuke Nojima

Authors
  1. Hisao Ishibuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tsutomu Doi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yusuke Nojima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Science Institute, University of Iceland, P.O. Box, Iceland

    Thomas Philip Runarsson

  2. Vorarlberg University of Applied Sciences, Hochschulstr. 1, A-6850, Dornbirn, Austria

    Hans-Georg Beyer

  3. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund Burke

  4. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-Guervós

  5. Colorado State University, 80523, Fort Collins, CO, USA

    L. Darrell Whitley

  6. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation