6533b837fe1ef96bd12a1cf5
RESEARCH PRODUCT
The node-depth encoding
Alexandre C. B. DelbemFranz RothlaufTelma Woerle De Limasubject
CombinatoricsDistributed minimum spanning treeSpanning treeOperator (computer programming)Encoding (memory)Euclidean minimum spanning treeEvolutionary algorithmInitializationMinimum spanning treeAlgorithmMathematicsdescription
The node-depth encoding has elements from direct and indirect encoding for trees which encodes trees by storing the depth of nodes in a list. Node-depth encoding applies specific search operators that is a typical characteristic for direct encodings. An investigation into the bias of the initialization process and the mutation operators of the node-depth encoding shows that the initialization process has a bias to solutions with small depths and diameters, and a bias towards stars. This investigation, also, shows that the mutation operators are unbiased. The performance of node-depth encoding is investigated for the bounded-diameter minimum spanning tree problem. The results are presented for Euclidean instances presented in the literature. In contrast with the expectation, the evolutionary algorithm using the biased initialization operator does not allow evolutionary algorithms to find better solutions compared to an unbiased initialization. In comparison to other evolutionary algorithms for the bounded-diameter minimum spanning tree evolutionary algorithms using the node-depth encoding have a good performance.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2008-07-12 | Proceedings of the 10th annual conference on Genetic and evolutionary computation |