Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
On the Locality of Standard Search Operators in Grammatical Evolution
verfasst von : Ann Thorhauer, Franz Rothlauf
Erschienen in: Parallel Problem Solving from Nature – PPSN XIII
Verlag: Springer International Publishing
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
Offspring should be similar to their parents and inherit their relevant properties. This general design principle of search operators in evolutionary algorithms is either known as locality or geometry of search operators, respectively. It takes a geometric perspective on search operators and suggests that the distance between an offspring and its parents should be less than or equal to the distance between both parents. This paper examines the locality of standard search operators used in grammatical evolution (GE) and genetic programming (GP) for binary tree problems. Both standard GE and GP search operators suffer from low locality since a substantial number of search steps result in an offspring whose distance to one of its parents is greater than the distance between both of its parents. Furthermore, the locality of standard GE search operators is higher than that of standard GP search operators, which allows more focused search in GE.