From the Dandelion Code to the rainbow code: A class of bijective spanning tree representations with linear complexity and bounded locality

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 2, 2006, Pages 108-123

  Paulden, Tim ^a   Smith, David K ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

Bijective representations; Bipartite graphs; Encodings; Evolutionary algorithms; Genetic algorithms (GAs); High locality representations; Layered graphs; Spanning trees

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); GRAPH THEORY; SET THEORY; TOPOLOGY;

ASYMPTOTICALLY OPTIMAL LOCALITY; BIJECTIVE REPRESENTATIONS; BIPARTITE GRAPHS; BOUNDED LOCALITY; DANDELION CODE; HIGH-LOCALITY REPRESENTATIONS; LAYERED GRAPHS; LINEAR COMPLEXITY; RAINBOW CODE; SPANNING TREES;

GENETIC ALGORITHMS;

EID: 33645579529     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.871249     Document Type: Article

References (42)

1. B. Y. Wu and K.-M. Chao, Spanning Trees and Optimization Problems. London, U.K.: Chapman & Hall, 2004.
2. C. C. Palmer and A. Kershenbaum. (1994) Representing trees in genetic algorithms. [Online]. Available: http://citeseer.ist.psu.edu/ palmer94representing.html
3. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms. Heidelberg, Germany: Physica-Verlag, 2002.
4. M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization. New York: Wiley, 2000.
5. E. B. Thompson, "The application of evolutionary algorithms to spanning tree problems," Ph.D. dissertation, University of Exeter, Exeter, U.K., 2003.
6. D. B. West, Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2001.
7. A. Cayley, "A theorem on trees," Quart. J. Math., vol. 23, pp. 376-378, 1889.
8. E. H. Neville, "The codifying of tree-structure," in Proc. Cambridge Philosophical Society, vol. 49, 1953, pp. 381-385.
9. H. Prüfer, "Neuer Beweis eines Satzes über Permutationen," Archiv der Mathematik and Physik, vol. 27, pp. 742-744, 1918.
10. A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms for Computers and Calculators, 2nd ed. New York: Academic, 1978.
11. H.-C. Chen and Y.-L. Wang, "An efficient algorithm for generating Prüfer codes from labelled trees," Theory of Comput. Syst., vol. 33, pp. 97-105, 2000.
12. S. Caminiti, I. Finocchi, and R. Petreschi, "A unified approach to coding labeled trees," in Lecture Notes in Computer Science-2976, Proc. LATIN 2004 - Theoretical Informatics, Buenos Aires, Argentina, Apr. 2004, pp. 339-348.
13. F. Rothlauf and D. E. Goldberg, "Pruefernumbers and genetic algorithms: A lesson how the low locality of an encoding can harm the performance of GAs," in Lecture Notes in Computer Science-1917, Proc. PPSN VI, Paris, France, Sept. 2000, pp. 395-404.
14. J. Gottlieb, B. A. Julstrom, G. R. Raidl, and F. Rothlauf, "Prüfer numbers: A poor representation of spanning trees for evolutionary search," IlliGAL Rep. 2001001, Jan. 2001.
15. S. Picciotto, "How to encode a tree," Ph.D. dissertation, Univ. California, San Diego, CA, 1999.
16. N. Deo and P. Micikevicius, "Prüfer-like codes for labeled trees," Congressus Numerantium, vol. 151, pp. 65-73, 2001.
17. N. Deo and P. Micikevicius, "A new encoding for labeled trees employing a stack and a queue," Bull. Inst. Combinatorics Appl., vol. 34, pp. 77-85, 2002.
18. B. A. Julstrom, "The Blob Code: A better string coding of spanning trees for evolutionary search," in Genetic and Evolutionary Computation Conference Workshop Program. San Mateo, CA, 2001, pp. 256-261.
19. A. García-Romero, "Un algorithmo genético para el árbol de expansión mínima capacitado," M.S. thesis, ITESM, Mexico, 1999.
20. E. B. Thompson, T. Paulden, and D. K. Smith, "The Dandelion Code: A new coding of spanning trees for genetic algorithms," IEEE Trans. Evol. Comput., 2004, submitted for publication.
21. Ö. Eǧecioǧlu and J. B. Remmel, "Bijections for Cayley trees, spanning trees, and their q-analogues," J. Combinatorial Theory (Series A), vol. 42, pp. 15-30, 1986.
22. P. J. Cameron. (2003, Spring) Enumerative & Asymptotic Combinatorics. Class notes for MTHM C50 (Notes 7), Queen Mary Univ. London, London, U.K. [Online]. Available: http://www.maths.qmu1.ac.uk/~pjc/C50/
23. A. Joyal, "Une théorie combinatoire des séries formelles," Advances in Mathematics, vol. 42, pp. 1-82, 1981.
24. K. E. Morrison, Random Maps and Permutations, Nov. 2003. Preprint, revised.
25. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography: 2 (Mathematics Background), 2001, pp. 54-55. [Online]. Available: http://www.cacr.math.uwaterloo.ca/hac/
26. Ö. Eǧecioǧlu and J. B. Remmel, "A bijection for spanning trees of complete multipartite graphs," Congressus Numerantium, vol. 100, pp. 225-243, 1994.
27. C. C. Palmer, "An approach to a problem in network design using genetic algorithms," Ph.D. dissertation, Polytechnic Univ., New York, 1994.
28. D. E. Knuth, "Another enumeration of trees," Canadian J. Math., vol. 20, pp. 1077-1086, 1968.
29. N. Hartsfield and J. S. Werth, "Spanning trees of the complete bipartite graph," in Topics in Combinatorics and Graph Theory: Essays in Honor of Gerhard Ringel, R. Bodendiek and R. Henn, Eds. Heidelberg, Germany: Physica-Verlag, 1990, pp. 339-346.
30. A. K. Kelmans, "Spanning trees of extended graphs," Combinatorica, vol. 12, no. 1, pp. 45-51, 1992.
31. R. P. Lewis, "The number of spanning trees of a complete multipartite graph," Discrete Mathematics, vol. 197/198, pp. 537-541, 1999.
32. M. Rubey, "Counting spanning trees," Diplomarbeit, Universität Wien, Wien, Austria, 2002. [Online]. Available: http://www.mat.univie.ac.at/~rubey/martin.html
33. J. Gottlieb and C. Eckert, "A comparison of two representations for the fixed charge transportation problem," in Lecture Notes in Computer Science-1917, Proc. PPSN VI, Paris, France, Sep. 2000, pp. 345-354.
34. C. Eckert and J. Gottlieb, "Direct representation and variation operators for the fixed charge transportation problem," in Lecture Notes in Computer Science-2439, Proc. PPSN VII, Granada, Spain, Sep. 2002, pp. 77-87.
35. M. Gen, R. Cheng, and S. S. Oren, "Network design techniques using adapted genetic algorithms," Advances Eng. Softw., vol. 32, pp. 731-744, 2001.
36. M. Gen, Y. Li, and K. Ida, "Solving multi-objective transportation problem by spanning tree-based genetic algorithm," IEICE Trans. Fundamentals of Electron., Commun. Comput. Sci., vol. E82 A, no. 12, pp. 2802-2810, 1999.
37. A. Syarif and M. Gen, "Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm," J. Intell. Manuf., vol. 14, pp. 389-399, 2003.
38. C. M. Murphy and M. S. Hung, "Network generation using the Prufer code," Comput. Oper. Res., vol. 13, no. 6, pp. 693-705, 1986.
39. T. Paulden and D. K. Smith, "The Rainbow Code: A superior genetic algorithm representation for layered trees," in Proc. 34th Int. Conf. Comput. Ind. Eng., San Francisco, CA, Nov. 14-16, 2004. (CD-ROM only).
40. A. Syarif and M. Gen, "Double spanning tree-based genetic algorithm for two stage transportation problem," Int. J. Knowl.-Based Intell. Eng. Syst., vol. 7, no. 4, pp. 214-221, 2003.
41. A. Syarif, Y.-S. Yun, and M. Gen, "Study on multi-stage logistic chain network: A spanning tree-based genetic algorithm approach," Comput. Ind. Eng., vol. 43, pp. 299-314, 2002.
42. F. Rothlauf. (2003, Jul.) Locality, distance distortion, and binary representations of integers. [Online]. Available: http://www.bwl. unimannheim.de/wifo1/publications/working_pa_paper_20_2003_11_11.pdf