A preliminary comparison of tree encoding schemes for evolutionary algorithms

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2007, Pages 1969-1974

  Carrano, Eduardo G ^a   Fonseca, Carlos M ^b   Takahashi, Ricardo H C ^a   Pimenta, Luciano C A ^a   Neto, Oriane M ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b UNIVERSITY OF ALGARVE   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; GENETIC ALGORITHMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CROSSOVER; OPTIMAL COMMUNICATION SPANNING; TREE ENCODING;

SIGNAL ENCODING;

EID: 40949109682     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2007.4414042     Document Type: Conference Paper

References (12)

1. F. Routhlauf, D. Goldberg, and A. Heinzl, "Network random key - A tree network representation scheme for genetic and evolutionary algorithms," Evolutionary Computation, vol. 10, pp. 75-97, 2002.
2. A. Cayley, "A theorem on trees," Quart. Journal of Mathematics, vol. 23, pp. 376-378, 1889.
3. R. Prim, "Shortest connection networks and some generalizations, " Bell. Syst. Tech. Jour., vol. 36, pp. 1389-1401, 1957.
4. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling sallesman problem," Proc. of Amer. Math. Soc. vol. 7, pp. 48-50, 1956.
5. S. Soak, D. W. Corne, and B. Ahn, "The edge-window-decoder representation for tree-based problems," IEEE Trans. Evol. Comput., vol. 10, no. 124-144, 2006.
6. H. Chou and G. P. C. Chu, "Genetic algorithms for communication network design - An empirical study of the factors that influence performance," IEEE Trans. Evol. Comput., pp. 236-249, 2001.
7. L. Lin and M. Gen, "Node-based genetic algorithm for communication spanning tree problem." IEICE Trans. Commun., vol. E89-B, pp. 1091-1098, 2006.
8. G. R. Raidl and B. A. Julstrom, "Edge-sets: An effective evolutionary encoding of spanning trees." IEEE Trans. Evol. Comput., vol. 7, pp. 225-239, 2003.
9. W. J. Connover, Practical Nonparametric Statistics, 3rd ed. Wiley, 1999.
10. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, USA: W. H. Freeman, 1979.
11. C. C. Palmer and A. Kershenbaum. "Representing trees in genetic algorithms," in Proc. IEEE Conference on Evolutionary Computation, Bristol, USA, 1994, pp. 379-384.
12. H. Prüfer, "Neuer Beweis eines Satzes über Permutationen," Arch. Math. Phys, vol. 27, pp. 742-744, 1918.