Abstract
The loss of genetic diversity in evolutionary algorithms may lead to suboptimal solutions. Many techniques have been developed for maintaining diversity in genetic algorithms, but few investigations have been done for genetic programs. We define here a diversity measure for genetic programs based on our metric for genetic trees [3]. We use this distance measure for studying the effects of fitness sharing. We then propose a method for adaptively maintaining the diversity of a population during evolution.
Cite
CITATION STYLE
Ekárt, A., & Németh, S. Z. (2002). Maintaining the diversity of genetic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2278, pp. 162–171). Springer Verlag. https://doi.org/10.1007/3-540-45984-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
