On the Locality of Standard Search Operators in Grammatical Evolution

Created by W.Langdon from gp-bibliography.bib Revision:1.8129

@InProceedings{Thorhauer:2014:PPSN,

• author = "Ann Thorhauer and Franz Rothlauf",
• title = "On the Locality of Standard Search Operators in Grammatical Evolution",
• booktitle = "13th International Conference on Parallel Problem Solving from Nature",
• year = "2014",
• editor = "Thomas Bartz-Beielstein and Juergen Branke and Bogdan Filipic and Jim Smith",
• publisher = "Springer",
• isbn13 = "978-3-319-10761-5",
• pages = "465--475",
• series = "Lecture Notes in Computer Science",
• address = "Ljubljana, Slovenia",
• month = "13-17 " # sep,
• volume = "8672",
• keywords = "genetic algorithms, genetic programming, grammatical evolution",
• DOI = "doi:10.1007/978-3-319-10762-2_46",
• abstract = "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.",
• notes = "PPSN-XIII",

}

Genetic Programming entries for Ann Thorhauer Franz Rothlauf

Citations