Abstract
Diversity represents an important aspect of genetic programming, being directly correlated with search performance.
When considered at the genotype level, diversity often requires expensive tree distance measures which have a negative impact on
the algorithm’s runtime performance. In this work we introduce a fast, hash-based tree distance measure to massively speed-up
the calculation of population diversity during the algorithmic run. We combine this measure with the standard GA and the
NSGA-II genetic algorithms to steer the search towards higher diversity. We validate the approach on a collection of benchmark
problems for symbolic regression where our method consistently outperforms the standard GA as well as NSGA-II configurations
with different secondary objectives.
Original language | English |
---|---|
Title of host publication | 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings |
Publisher | IEEE Computational Intelligence Society |
Pages | 2175-2182 |
Number of pages | 8 |
ISBN (Electronic) | 9781728121536 |
ISBN (Print) | 1089-778X |
DOIs | |
Publication status | Published - Jun 2019 |
Event | IEEE Congress on Evolutionary Computation - Wellington, New Zealand, Australia Duration: 10 Jun 2019 → 13 Jun 2019 http://cec2019.org/index.html |
Publication series
Name | 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings |
---|
Conference
Conference | IEEE Congress on Evolutionary Computation |
---|---|
Country/Territory | Australia |
City | Wellington, New Zealand |
Period | 10.06.2019 → 13.06.2019 |
Internet address |
Keywords
- symbolic regression
- genetic programming
- multi-objective symbolic regression
- tree distance
- genetic diversity
- population diversity
- tree hash
- multi-objective