Skip to main content
SpringerLink
Log in
Book cover

EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV pp 277–291Cite as

Genetic Programming with Scale-Free Dynamics

  • Conference paper

  • 850 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 227))

Abstract

This paper describe a new selection method, named SFSwT (Scale-Free Selection method with Tournament mechanism) which is based on a scale-free network study. A scale-free selection model was chosen in order to generate a scale-free structure. The proposed model reduces computational complexity and improves computational performance compared with a previous version of the model. Experimental results with various benchmark problems show that performance of the SFSwT is higher than with other selection methods. In various fields, scale-free structures are closely related to evolutionary computation. Further, it was found through the experiments that the distribution of node connectivity could be used as an index of search efficiency.

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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74 (2002)

    Google Scholar 

  2. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  3. Kivac Oner, M., Garibay, I.I., Wu, A.S.: Mating Networks in Steady State Genetic Algorithms are Scale Free. In: Genetic and Evolutionary Computation Conference 2006 (GECCO 2006), pp. 1423–1424 (2006)

    Google Scholar 

  4. Giacobini, M., Tomassini, M., Tettamazi, A.: Takeover Time Curves in Random and Small-World Structured Populations. In: Genetic and Evolutionary Computation Conference (GECCO 2005), pp. 1333–1340 (2005)

    Google Scholar 

  5. Lieberman, E., Hauert, C., Nowak, A.: Evolutionary dynamics on graphs. Nature 433(20), 312–316 (2005)

    Article  Google Scholar 

  6. Araseki, H.: Effectiveness of Scale-Free Properties in Genetic Programming. In: SCIS-ISIS 2012, pp. 285–289 (2012)

    Google Scholar 

  7. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003)

    Google Scholar 

  8. Ohkubo, J., Horiguchi, T.: Complex Networks by Non-growing Model with Preferential Rewiring Process. Journal of the Physical Society of Japan 74(4), 1334–1340 (2005)

    Article  Google Scholar 

  9. Ohkubo, J., Tanaka, K., Horiguchi, T.: Generation of complex bipartite graphs by using a preferential rewiring process. Physical Review E (72), 036120 (2005)

    Google Scholar 

  10. Baiesi, M., Manna, S.: Scale-free networks from a Hamiltonian dynamics. Phys. Rev. E 68, 047103 (2003)

    Google Scholar 

  11. Fang, Y., Li, J.: A Review of Tournament Selection in Genetic Programming. In: Cai, Z., Hu, C., Kang, Z., Liu, Y. (eds.) ISICA 2010. LNCS, vol. 6382, pp. 181–192. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Blickle, T., Thicle, L.: A Mathematical Analysis of Tournament Selection. In: Proceedings of the 6th International Conference on Genetic Algorithms (ICGA 1995), pp. 9–16 (1995)

    Google Scholar 

  13. Bianconi, G., Barabási, A.-L.: Competition and multiscaling in evolving networks. Europhys. Lett. 54(4), 436–442 (2001)

    Article  Google Scholar 

  14. Sato, H., Ono, I., Kobayashi, S.: A new generation alternation method of genetic algorithms and its assessment. J. of Japanese Society for Artificial Intelligence 12(5), 734–744 (1997)

    Google Scholar 

  15. Erdös, P., Rényi, A.: On the evolution of random graph. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5, 17 (1960)

    MATH  Google Scholar 

  16. Dignum, S., Poli, R.: Sub-tree Swapping Crossover and Arity Histogram Distributions. In: Esparcia-Alcázar, A.I., Ekárt, A., Silva, S., Dignum, S., Uyar, A.Ş. (eds.) EuroGP 2010. LNCS, vol. 6021, pp. 38–49. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Muntean, O., Diosan, L., Oltean, M.: Best SubTree Genetic Programming. In: Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 1667–1673 (2007)

    Google Scholar 

  18. Punch, B., Zongker, D., Goodman, E.: The Royal Tree Problem, a Benchmark for Single and Multiple Population Genetic Programming. In: Advances in Genetic Programming, vol. 2, pp. 299–316. MIT Press (1996)

    Google Scholar 

  19. Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Social and Cultural Studies, Nihon University, 4-25, Nakatomi-Minami, Tokorozawa, Saitama, Japan

    Hitoshi Araseki

Authors
  1. Hitoshi Araseki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hitoshi Araseki .

Editor information

Editors and Affiliations

  1. , Leiden Institute of Advanced, Leiden University, Niels Bohrweg 1, Leiden, 2333CA, Netherlands

    Michael Emmerich

  2. , Leiden Institute of Advanced, Leiden University, Niels Bohrweg 1, Leiden, 2333CA, Netherlands

    Andre Deutz

  3. , Depto. de Computacion, CINVESTAV-IPN, Av. IPN No. 2508, Col. San Pedro Zacatenco, Mexico, 07360, Mexico

    Oliver Schuetze

  4. , Leiden Institute of Advanced, Leiden University, Niels Bohrweg 1, Leiden, 2333CA, Netherlands

    Thomas Bäck

  5. , Luxembourg Centre for, University of Luxembourg, Avenue des Hauts Fourneaux 7, Belval, 4362, Luxembourg

    Emilia Tantar

  6. , Computer Science and, University of Luxembourg, rue Richard Coudenhove-Kalergi 6, Luxembourg, 1359, Luxembourg

    Alexandru-Adrian Tantar

  7. , Bordeaux Mathematical Institute, Université Bordeaux I, cours de la Libération 351, Talence cedex, 33405, France

    Pierre Del Moral

  8. , UFR Sciences et Modélisation, Université Bordeaux Segalen, 3ter place de la Victoire, Bordeaux, 33076, France

    Pierrick Legrand

  9. Faculty of Sci., Tech. & Communication, Computer Science and, University of Luxembourg, rue Richard Coudenhove-Kalergi 6, Luxembourg, 1359, Luxembourg

    Pascal Bouvry

  10. , Depto. de Computatción, CINVESTAV-IPN, Av. IPN No. 2508, Col. San Pedro Zacatenco, Mexico, 07360, Mexico

    Carlos A. Coello

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Araseki, H. (2013). Genetic Programming with Scale-Free Dynamics. In: Emmerich, M., et al. EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV. Advances in Intelligent Systems and Computing, vol 227. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-01128-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01128-8_18

  • Publisher Name: Springer, Heidelberg

  • Print ISBN: 978-3-319-01127-1

  • Online ISBN: 978-3-319-01128-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation