The Dandelion code: A new coding of spanning trees for genetic algorithms

IEEE Transactions on Evolutionary Computation

Volumn 11, Issue 1, 2007, Pages 91-100

  Thompson, Evan ^a   Paulden, Tim ^b   Smith, David K ^b  

^a UK Department for Work and Pensions   (United Kingdom)

^b UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

Blob code; Dandelion code; Encoding; Genetic algorithms (GAs); One max tree problem; Optimal communication spanning tree (OCST) problem; Pr fer code; Pr fer string; Representation; Spanning trees

Indexed keywords

ENCODING (SYMBOLS); MAPPING; TREES (MATHEMATICS);

BLOB CODE; DANDELION CODE; ONE-MAX-TREE PROBLEM; SPANNING TREES;

GENETIC ALGORITHMS;

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

References (30)

1. F. Rothlauf, D. E. Goldberg, and A. Heinzl, Network random keys - A tree network representation scheme for genetic and evolutionary algorithms Univ. Illinois at Urbana-Champaign, Urbana, IL, IlliGAL 2000031, Jul. 2000. Online. Available: http://www-illigal.ge.uiuc.edu/
2. G. R. Raidl and B. A. Julstrom, "Edge-sets: An effective evolutionary coding of spanning trees," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 225-239, Jun. 2003.
3. A. Cayley, "A theorem on trees," Quart. J. Math., vol. 23, pp. 376-378, 1889.
4. H. Prüfer, "Neuer beweis eines satzes über permutationen," Arch. Math. Phys., vol. 27, pp. 742-744, 1918.
5. B. A. Julstrom, "A genetic algorithm for the rectilinear Steiner problem," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed., 1993, pp. 474-479.
6. F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld, "Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem," in Proc. 6th Int. Conf. Genetic Algorithms, L. Eshelman, Ed., 1995, pp. 470-477.
7. G. Zhou and M. Gen, "A note on genetic algorithms for degree-constrained spanning tree problems," Networks, vol. 30, pp. 91-95, 1997.
8. M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaihi, Comparison of algorithms for the degree-constrained minimum spanning tree CSIRO Math. Inf. Sci., Monash Univ., Clayton, Australia, Tech. Rep., 1999.
9. C. C. Palmer and A. Kershenbaum, "An approach to a problem in network design using genetic algorithms," Networks, vol. 26, pp. 151-163, 1995.
10. F. Rothlauf, "Towards a theory of representations for genetic and evolutionary algorithms," Ph.D. dissertation, Dept. Inf. Syst., University of Bayreuth, Bayreuth, Germany, 2001.
11. E. H. Neville, "The codifying of tree-structure," in Proc. Cambridge Philosophical Soc., 1953, vol. 49, pp. 381-385.
12. B. A. Julstrom, "The Blob code: A better string coding of spanning trees for evolutionary search," in Proc. Genetic and Evol. Comput. Conf. Workshop Program, 2001, pp. 256-261.
13. S. Picciotto, "How to encode a tree," Ph.D. dissertation, Dept. Mathematics, Univ. California, San Diego, CA, 1999.
14. T. Paulden and D. K. Smith, "From the Dandelion Code to the Rainbow Code: A class of bijective spanning tree representations with linear complexity and bounded locality," IEEE Trans. Evol. Comput., vol. 10, no. 2, pp. 108-123, Apr. 2006.
15. N. Deo and P. Micikevicius, "Prüfer-like codes for labeled trees," in Proc. Congressus Numerantium, 2001, vol. 151, pp. 65-73. [Online]. Available: http://www.cs.ucf.edu/pmicikev/publications/ prufer-likecodes.pdf
16. E. Thompson, "The application of evolutionary algorithms to spanning tree problems," Ph.D. dissertation, School Math. Sci., Univ. Exeter, Exeter, U.K., 2003.
17. A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms for Computers and Calculators, ser. Computer Science and Applied Mathematics, 2nd ed. New York: Academic, 1978.
18. T. Paulden and D. K. Smith, "Recent advances in the study of the dandelion code, happy code, and blob code spanning tree representations," in Proc. IEEE World Congr. Comput. Intell., 2006, to appear.
19. J. B. Kruskal, "On the shortest spanning subtree of a graph and the travelling salesman problem," in Proc. Amer. Math. Soc., 1956, vol. 7, pp. 48-50.
20. G. R. Raidl, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," in Proc. IEEE Conf. Evol. Comput., 2000, pp. 379-384.
21. R. C. Prim, "Shortest connection networks and some generalisations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, 1957.
22. C. Höhn and C. R. Reeves, "The crossover landscape for the Onemax problem," in Proc. 2nd Nordic Workshop on Genetic Algorithms, J. Alander, Ed., 1996, pp. 27-43.
23. J. Gottlieb, B. A. Julstrom, G. R. Raidl, and F. Rothlauf, "Prüfer numbers: A poor representation of spanning trees for evolutionary search," in Proc. Genetic Evol. Comput. Conf., 2001, pp. 343-350.
24. T. C. Hu, "Optimum communication spanning trees," SIAM J. Comput., vol. 3, no. 3, pp. 188-195, 1974.
25. D. S. Johnson, J. K. Lenstra, and A. H. G. R. Kan, "The complexity of the network design problem," Networks, vol. 8, pp. 279-285, 1978.
26. R. K. Ahuja and V. V. S. Murty, "Exact and heuristic algorithms for the optimum communication spanning tree problem," Transportation Sci., vol. 21, pp. 163-170, 1987.
27. C. C. Palmer, "An approach to a problem in network design using genetic algorithms," Ph.D. dissertation, Dept. Comput. Sci., Polytechnic Univ., New York, 1994. [Online]. Available: http://citeseer.nj.nec.com/palmer95approach.html
28. L. T. M. Berry, B. A. Murtagh, and S. J. Sugden, "A genetic-based approach to tree network synthesis with cost constraints," in Proc. 2nd Eur. Congr. Intell. Tech. Soft Comput., 1994, pp. 626-629.
29. G. Liepins and M. D. Vose, "Representational issues in genetic optimization," J. Experimental and Theoretical Artif. Intell., vol. 2, pp. 101-115, 1990.
30. Y. Davidor, "Epistasis variance: A viewpoint on GA-hardness," Foundations of Genetic Algorithms 1, pp. 23-35, 1991.