Skip to main content
Erschienen in: Natural Computing 1/2010

01.03.2010

Effect of parent selection and sibling rivalry on building-block assembly

verfasst von: Leon Poladian

Erschienen in: Natural Computing | Ausgabe 1/2010

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Any crossover operator has both beneficial and detrimental effects: it can bring building blocks together or it can tear them apart. In this paper, we provide evidence that the recombination can be biased towards its more beneficial aspects by modifying both the parent selection process and the number of children created by each pair of parents. We exclude both high rank and low rank individuals from being selected as parents. The new idea is that the worst individuals do not have valuable building blocks to contribute, and it is too risky to subject the best individuals to crossover and have their building blocks separated. In a further refinement, we allow the number of children per family to be correlated to the diversity of their parents, and thus increase the pressure of sibling rivalry (competition). These ideas are tested on well-known test functions such as the hierarchical if-and-only-if, royal road, concatenated trap functions and the one dimensional Ising spin model. Four different parent selection schemes are compared and simulations are shown for both two children (fixed) and many children (variable) families. The results indicate that these changes are beneficial for a wide class of problems.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Ackley DH (1987) An empirical study of bit vector function optmization. In: Davis L (ed) Genetic algorithms and simulated annealing. Pitmann, London, pp 170–204 Ackley DH (1987) An empirical study of bit vector function optmization. In: Davis L (ed) Genetic algorithms and simulated annealing. Pitmann, London, pp 170–204
Zurück zum Zitat Burt A (2000) Perspective: sex, recombination, and the efficacy of selection – was Weismann right? Evolution 54:337–351 Burt A (2000) Perspective: sex, recombination, and the efficacy of selection – was Weismann right? Evolution 54:337–351
Zurück zum Zitat Fisher RA (1958) The genetical theory of natural selection, 2nd edn. Dover, New York Fisher RA (1958) The genetical theory of natural selection, 2nd edn. Dover, New York
Zurück zum Zitat Forrest S, Mitchell M (1993) Relative building block fitness and the building block hypothesis. In: Whitley D (ed) Foundations of genetic algorithms, 2nd edn. Morgan Kauffmann, San Francisco Forrest S, Mitchell M (1993) Relative building block fitness and the building block hypothesis. In: Whitley D (ed) Foundations of genetic algorithms, 2nd edn. Morgan Kauffmann, San Francisco
Zurück zum Zitat Goldberg DE (1989) Genetic algorithms in search optimisation and machine learning. Addison-Wesley, Reading Goldberg DE (1989) Genetic algorithms in search optimisation and machine learning. Addison-Wesley, Reading
Zurück zum Zitat Goldberg DE (2002) The design of innovation. Kluwer Academic Publishers, BostonMATH Goldberg DE (2002) The design of innovation. Kluwer Academic Publishers, BostonMATH
Zurück zum Zitat Goldberg DE, Korb B, Deb K (1989) Messy genetic algorithms: motivation, analysis and first results. Complex Syst 3(5):493–530MATHMathSciNet Goldberg DE, Korb B, Deb K (1989) Messy genetic algorithms: motivation, analysis and first results. Complex Syst 3(5):493–530MATHMathSciNet
Zurück zum Zitat Harik GR (1997) Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. Ph.D. thesis, University of Michigan, Ann Arbor Harik GR (1997) Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. Ph.D. thesis, University of Michigan, Ann Arbor
Zurück zum Zitat Holland JH (1975) Adaptation in natural and artifical systems. The University of Michigan Press, Ann Arbor Holland JH (1975) Adaptation in natural and artifical systems. The University of Michigan Press, Ann Arbor
Zurück zum Zitat Holland JH (2000) Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evol Comput 8(4):373–391CrossRefMathSciNet Holland JH (2000) Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evol Comput 8(4):373–391CrossRefMathSciNet
Zurück zum Zitat Mitchell M, Forrest S, Holland JH (1992) The royal road for genetic algorithms: fitness landscapes and GA performance. In: Proceedings of first European conference on artificial life. MIT Press, Cambridge, pp 245–254 Mitchell M, Forrest S, Holland JH (1992) The royal road for genetic algorithms: fitness landscapes and GA performance. In: Proceedings of first European conference on artificial life. MIT Press, Cambridge, pp 245–254
Zurück zum Zitat Pelikan M, Goldberg DE, Cantu-Paz E (1999) BOA: the Bayesian optimization algorithm. In: Proceedings of GECCO 1999, vol 1, pp 525–532 Pelikan M, Goldberg DE, Cantu-Paz E (1999) BOA: the Bayesian optimization algorithm. In: Proceedings of GECCO 1999, vol 1, pp 525–532
Zurück zum Zitat Prugel-Bennet A, Shapiro JL (1994) Analysis of genetic algorithms using statistical mechanics. Phys Rev Lett 72(9):1305–1309CrossRef Prugel-Bennet A, Shapiro JL (1994) Analysis of genetic algorithms using statistical mechanics. Phys Rev Lett 72(9):1305–1309CrossRef
Zurück zum Zitat Watson RA (2006) Compositional evolution: the impact of sex, symbiosis, and modularity on the gradualist framework of evolution. MIT Press, Cambridge Watson RA (2006) Compositional evolution: the impact of sex, symbiosis, and modularity on the gradualist framework of evolution. MIT Press, Cambridge
Zurück zum Zitat Watson RA, Hornby GS, Pollack JB (1998) Modelling building-block interdependency. In: Parallel problem solving from nature, PPSN V, pp 97–106 Watson RA, Hornby GS, Pollack JB (1998) Modelling building-block interdependency. In: Parallel problem solving from nature, PPSN V, pp 97–106
Zurück zum Zitat Weismann A (1889) Essays on heredity and kindred biological subjects. Oxford University Press, Oxford Weismann A (1889) Essays on heredity and kindred biological subjects. Oxford University Press, Oxford
Zurück zum Zitat Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef
Metadaten
Titel
Effect of parent selection and sibling rivalry on building-block assembly
verfasst von
Leon Poladian
Publikationsdatum
01.03.2010
Verlag
Springer Netherlands
Erschienen in
Natural Computing / Ausgabe 1/2010
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-009-9108-1

Weitere Artikel der Ausgabe 1/2010

Natural Computing 1/2010 Zur Ausgabe

EditorialNotes

Foreword

Premium Partner