%0 Conference Proceedings
%A Woerle de Lima, Telma
%A C. B. Delbem, Alexandre
%A Rothlauf, Franz
%D 2008
%T The Node-Depth Encoding: Analysis and Application to the Bounded-Diameter Minimum Spanning Tree Problem
%E Keijzer, Maarten
%B Proceedings of the Genetic and Evolutionary Computation Conference
%I ACM Press
%8 July, 2008
%1 en
%X The node-depth encoding has elements from direct and undirect 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 characteristics 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 to 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 (BDMSTP). The results are presented for Euclidean instances presented in the literature. In contrast with the expectation, the EA using the biased initialization operator does not allow EAs to find better solutions compared to an unbiased initialization. In comparison with other EAs for the bounded-diameter minimum spanning tree EAs using the node-depth encoding perform well.
%J GECCO 2008
%( Atlanta
%K Genetic Algorithms, Representations, Performance Analysis}
%$ 2008-03-14