Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Analysis and Design of Search Operators for Trees
verfasst von : Dr. Franz Rothlauf
Erschienen in: Representations for Genetic and Evolutionary Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
When using GEAs for tree problems it is necessary to encode a solution (tree) such that evolutionary search operators like crossover or mutation can be applied. There are two different possibilities for doing this: indirect representations usually encode a tree (phenotype) as a list of strings (genotypes) and apply standard search operators to the genotypes. The phenotype is constructed by an appropriate genotype-phenotype mapping (representation). As seen in the previous chapter, there are many indirect representations for trees such as NetKeys, the LNB encoding, the CV encoding, or Prüfer numbers.