Permutation-based recombination operator to node-depth encoding

Citations of this article
Mendeley users who have this article in their library.


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 the representation has this restriction, it has obtained good results with low convergence. Then, this work proposes a specific recombination operator to improve the convergence of the node-depth encoding representation. These operators are based on recombination for permutation representations. An investigation into the bias and heritability of the proposed recombination operator shows that it has a bias towards stars and low heritability. The performance of node-depth encoding with the proposed operator is investigated for the optimal communication spanning tree problem. The results are presented for benchmark instances in the literature. The use of the recombination operator results in a faster convergence than with only mutation operators.




De Lima, T. W., Delbem, A. C. B., Lima, R. L., Sabin, G. P., & De Oliveira, M. A. A. (2016). Permutation-based recombination operator to node-depth encoding. In Procedia Computer Science (Vol. 80, pp. 279–288). Elsevier B.V.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free