Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
The node-depth encoding is a representation for evolutionary algorithms applied to tree problems. Its represents trees by storing the nodes and their depth in a proper ordered list. The original formulation of the node-depth encoding has only mutation operators as the search mechanism. Although it is computationally efficient, the exclusive use of mutation restricts the exploration of the search space and the algorithm convergence. Then, this work proposes two specific recombination operators to improve the convergence of the algorithm using the node-depth encoding representation. These operators are based on recombination operators for permutation representations. Analysis of the proposed recombination operators have shown that both operators have a bias towards stars and high heritability.