AB  - This paper applies a recent information - theoretic approach to controlling Genetic Algorithms (GAs) called HMXT to tree - based Genetic Programming (GP). HMXT, in a GA domain, requires the setting of selection thresholds in a population and the application of high levels of crossover to thoroughly mix alleles. Applying these in a tree - based GP setting is not trivial. We present results comparing HMXT - GP to Koza - style GP for varying amounts of crossover and over three different optimisation (minimisation) problems. Results show that average fitness is better with HMXT - GP because it maintains more diversity in populations, but that the minimum fitness found was better with Koza. HMXT allows straightforward tuning of population diversity and selection pressure by altering the position of the selection thresholds. © 2011 ACM.
AU  - Santosa, H
AU  - Milton, J
AU  - Kennedy, PJ
DA  - 2011/06/23
DO  - 10.1145/1982185.1982420
EP  - 1075
JO  - Proceedings of the ACM Symposium on Applied Computing
PY  - 2011/06/23
SP  - 1070
TI  - HMXT-GP: An information-theoretic approach to genetic programming that maintains diversity
Y1  - 2011/06/23
Y2  - 2026/07/28
ER  -