6533b823fe1ef96bd127e94d

RESEARCH PRODUCT

On the Non-uniform Redundancy in Grammatical Evolution

Ann Thorhauer

subject

Binary treeComputer scienceBinary number0102 computer and information sciences02 engineering and technologyENCODE01 natural sciencesTree (graph theory)Tree structure010201 computation theory & mathematicsGrammatical evolution0202 electrical engineering electronic engineering information engineeringRedundancy (engineering)020201 artificial intelligence & image processingRepresentation (mathematics)Algorithm

description

This paper investigates the redundancy of representation in grammatical evolution (GE) for binary trees. We analyze the entire GE solution space by creating all binary genotypes of predefined length and map them to phenotype trees, which are then characterized by their size, depth and shape. We find that the GE representation is strongly non-uniformly redundant. There are huge differences in the number of genotypes that encode one particular phenotype. Thus, it is difficult for GE to solve problems where the optimal tree solutions are underrepresented. In general, the GE mapping process is biased towards short tree structures, which implies high GE performance if the optimal solution requires small programs.

https://doi.org/10.1007/978-3-319-45823-6_27