On the bias and performance of the edge-set encoding

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 3, 2009, Pages 486-499

  Rothlauf, Franz ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Bias; Edge sets; One max tree problem; Optimal communication spanning tree (OCST) problem; Tree representation

Indexed keywords

BIAS; EDGE-SETS; ONE-MAX TREE PROBLEM; OPTIMAL COMMUNICATION SPANNING TREE (OCST) PROBLEM; TREE REPRESENTATION;

COMMUNICATION; ENCODING (SYMBOLS); EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMAL SYSTEMS; OPTIMIZATION;

GRAPH THEORY;

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

References (50)

1. S. C. Narula and C. A. Ho, "Degree-constrained minimum spanning trees," Comput. Oper. Res., vol. 7, pp. 239-249, 1980.
2. S. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, and N. Young, "A network-flow technique for finding low-weight bounded-degree spanning trees," J. Algorithms, vol. 24, pp. 310-324, 1997.
3. 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, 2003.
4. T. C. Hu, "Optimum communication spanning trees," SIAM J. Comput. vol. 3, no. 3, pp. 188-195, Sept. 1974.
5. C. C. Palmer, "An approach to a problem in network design using genetic algorithms," unpublished Ph.D. dissertation, Polytechnic University, Troy, NY, 1994.
6. L. T. M. Berry, B. A. Murtagh, and G. McMahon, "Applications of a genetic-based algorithm for optimal design of tree-structured communication networks," in Proc. Regional Teletraffic Eng. Conf. Int. Teletraffic Congr., Pretoria, South Africa, 1995, pp. 361-370, Telkom South Africa.
7. F. Rothlauf, D. E. Goldberg, and A. Heinzl, "Network random keys - A tree network representation scheme for genetic and evolutionary algorithms," Evol. Comput., vol. 10, no. 1, pp. 75-97, 2002.
8. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," in Proc. 1st IEEE Conf. Evol. Comput., 1994, vol. 1, pp. 379-384.
9. 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. Eschelman, Ed., 1995, pp. 470-477.
10. H. Prüfer, Neuer Beweis eines Satzes über Permutationen," Archiv für Mathematik und Physik, vol. 27, pp. 742-744, 1918.
11. 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, L. Spector, E. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, Eds., 2001, pp. 343-350.
12. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms 2nd ed. Heidelberg, Germany: Springer-Verlag, 2006.
13. B. Julstrom and G. Raidl, "Weight-biased edge-crossover in evolutionary algorithms for two graph problems," in Proc. 16th ACM Symp. Appl. Comput., G. Lamont, Ed. et al., 2001, pp. 321-326.
14. F. Rothlauf, J. Gerstacker, and A. Heinzl, On the optimal communication spanning tree problem Dept. Inf. Syst., Univ. Mannheim, Manheim, Germany, Tech. Rep. 15/2003, 2003.
15. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
16. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
17. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979.
18. L. Davis, D. Orvosh, A. Cox, and Y. Qiu, "A genetic algorithm for survivable network design," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed., 1993, pp. 408-415.
19. M. C. Sinclair, "Minimum cost topology optimization of the COST 239 European optical network," in Proc. 1995 Int. Conf. Artif. Neural Nets and Genetic Algorithms, D. W. Pearson, N. C. Steele, and R. F. Albrecht, Eds., New York, 1995, pp. 26-29.
20. L. T. M. Berry, B. A. Murtagh, G. McMahon, and S. Sugden, "Optimization models for communication network design," in Proc. 4th Int. Meeting Decision Sciences Institute, Sydney, Australia, 1997, pp. 67-70.
21. G. R. Raidl and B. A. Julstrom, "A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem," in Proc. 2000 ACM Symp. Appl. Comput., J. Carroll, E. Damiani, H. Haddad, and D. Oppenheim, Eds., 2000, pp. 440-445.
22. M. Krishnamoorthy and A. T. Ernst, "Comparison of algorithms for the degree constrained minimum spanning tree," J. Heuristics, vol. 7, pp. 587-611, 2001.
23. A. Cayley, "A theorem on trees," Quarterly J. Mathematics, vol. 23, pp. 376-378, 1889.
24. E. H. Neville, "The codifying of tree-structure," in Proc. Cambridge Philosophical Society, 1953, vol. 49, pp. 381-385.
25. N. Deo and P. Micikevicius, "Prüfer-like codes for labeled trees," Congressus Numerantium, vol. 151, pp. 65-73, 2001.
26. S. Picciotto, "How to encode a tree," Ph.D. dissertation, Univ. California, San Diego, CA, 1999.
27. S. Caminiti, I. Finocchi, and R. Petreschi, "A unified approach to coding labeled trees," in LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, M. Farach-Colton, Ed., 2004, vol. 2976, LNCS, pp. 339-348 [Online]. Available: http://springerlink.metapress.com/ openurl.asp?genre=article&issn=03%02-9743&volume= 2976&spage=339
28. F. Rothlauf and D. E. Goldberg, "Tree network design with genetic algorithms - An investigation in the locality of the prüfernumber encoding," in Proc, Late Breaking Papers at the Genetic and Evol. Comput. Conf. 1999, S. Brave and A. S. Wu, Eds., 1999, pp. 238-244.
29. B. A. Julstrom, "The blob code:A better string coding of spanning trees for evolutionary search," in Proc. 2001 Genetic and Evolut. Comput. Conf. Workshop Program, A. S. Wu, Ed., 2001, pp. 256-261.
30. S. Caminiti and R. Petreschi, "String coding of trees with locality and heritability," in Proc. Comput. Combinatorics, 11th Annu. Int. Conf., COCOON 2005, L. Wang, Ed., 2005, vol. 3595, LNCS, pp. 251-262. [Online]. Available: http://dx.doi.org/10.1007/11533719_27, Springer
31. 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. 124-144, Apr. 2006.
32. E. Thompson, T. Paulden, and D. K. Smith, "The dandelion code: A new coding of spanning trees for genetic algorithms," IEEE Trans. Evol. Comput., vol. 11, no. 1, pp. 91-100, Feb. 2007.
33. Y. Li, "An effective implementation of a direct spanning tree representation in GAs," in Proc. EvoWorkshops 2001 Appl. Evol. Comput., E. J. W. Boers, S. Cagnoni, J. Gottlieb, E. Hart, P. L. Lanzi, G. R. Raidl, R. E. Smith, and H. Tijink, Eds., 2001, pp. 11-19.
34. G. R. Raidl and J. Gottlieb, "Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem," Evolut. Comput., vol. 13, no. 4, pp. 441-475, 2005.
35. F. Rothlauf and D. E. Goldberg, "Redundant representations in evolutionary computation," Evolut. Comput., vol. 11, no. 4, pp. 381-415, 2003.
36. G. R. Raidl, G. Koller, and B. A. Julstrom, "Biased mutation operators for subgraph-selection problems," IEEE Trans. Evol. Comput., vol. 10, no. 2, pp. 145-156, 2006.
37. C. Tzschoppe, F. Rothlauf, and H.-J. Pesch, "The edge-set encoding revisited: On the bias of a direct representation for trees," in Proc. Genetic Evol. Comput. Conf. 2004, K. Deb, Ed. et al., 2004, pp. 1174-1185.
38. E. Reshef, "Approximating minimum communication cost spanning trees and related problems," Master's thesis, Feinberg Graduate School of the Weizmann Inst. Sci., Rehovot, Israel, Apr. 1999, 76100.
39. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci., vol. 43, pp. 425-440, 1991.
40. R. E. Gomory and T. C. Hu, "Multi-terminal network flows," SIAM J. Appl. Math., vol. 9, pp. 551-570, 1961.
41. 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.
42. B. Y. Wu, G. Lancia, Y. Bafna, K. M. Chao, R. Ravi, and C. Y. Tang, "A polynomial time approximation schem for minimum routing cost spanning trees," in Proc. 9th ACM-SIAM Symp. Discrete Algorithms, Jan. 1998, pp. 21-32.
43. R. Wong, "Worst case analysis of network design problem heuristics," SIAM J. Algebraic Discr. Meth., vol. 1, pp. 51-63, 1980.
44. D. Peleg, "Approximating minimum communication spanning trees," in Proc. 4th Colloq. Structural Information and Communication Complexity Ascona, Switzerland, 1997.
45. N. Alon, R. M. Karp, D. Peleg, and D. West, "A graph theoretic game and its application to the κ-server problem," SIAM J. Computing, vol. 24, pp. 78-100, 1995.
46. Y. Bartal, "On approximating arbitrary metrics by tree metrics," in Proc. 30th Annu. ACM Symp. Theory of Comput. Sci., 1998, pp. 161-168.
47. D. Peleg and E. Reshef, "Deterministic polylog approximation for minimum communication spanning trees," Lecture Notes in Computer Science, vol. 1443, pp. 670-682, 1998.
48. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin, "Approximating a finite metric by a small number of tree metrics," in Proc. 39th IEEE Symp. Foundations Comput. Sci., 1998, pp. 111-125.
49. G. R. Harik, E. Cantü-Paz, D. E. Goldberg, and B. L. Miller, "The gambler's ruin problem, genetic algorithms, and the sizing of populations," in Proc. 4th Int. Conf. Evol. Comput., T. Bäck, Ed., 1997, pp. 7-12.
50. G. R. Raidl, Various Instances of Optimal Communication Spanning Tree Problems. Feb. 2001, personal communciation.