Edge sets: An effective evolutionary coding of spanning trees

IEEE Transactions on Evolutionary Computation

Volumn 7, Issue 3, 2003, Pages 225-239

  Raidl, Günther R ^a   Julstrom, Bryant A ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Degree constraints; Edge set representation; Evolutionary algorithms; Hybridization; Network design; One max tree problem; Spanning trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECODING; ENCODING (SYMBOLS); HEURISTIC METHODS; MATHEMATICAL OPERATORS; TREES (MATHEMATICS);

EDGE SETS; EVOLUTIONARY CODING; SPANNING TREES;

EVOLUTIONARY ALGORITHMS;

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

References (59)

1. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," in Proc. Amer. Math. Soc., vol. 7, 1956, pp. 48-50.
2. R. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, 1957.
3. B. Chazelle, "A minimum spanning tree algorithm with inverse-Ackermann type complexity," J. Assoc. Comput. Mach., vol. 47, no. 6, pp. 1028-1047, 2000.
4. T. C. Hu, "Optimum communication spanning trees," SIAM J. Comput., vol. 3, pp. 188-195, 1974.
5. M. L. Gargano, W. Edelson, and O. Koval, "A genetic algorithm with feasible search space for minimal spanning trees with time-dependent edge costs," in Genetic Programming 1998: Proc. 3rd Annu. Conf., J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, H. Iba, and R. L. Riolo, Eds., 1998, p. 495.
6. S. C. Narula and C. A. Ho, "Degree-constrained minimum spanning trees," Comput. Oper. Res., vol. 7, pp. 239-249, 1980.
7. G. Zhou and M. Gen, "Genetic algorithms on leaf-constrained minimum spanning tree problem," Beijing Math., vol. 7, no. 2, pp. 50-62, 1998.
8. L. R. Esau and K. C. Williams, "On teleprocessing system design," IBM Syst. J., vol. 5, pp. 142-147, 1966.
9. C. H. Papadimitriou, "The complexity of the capacitated tree problem," Networks, vol. 8, pp. 217-230, 1978.
10. M. Hanan, "On Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, no. 2, pp. 255-265, 1966.
11. G. M. Guisewite and P. M. Pardalos, "Minimum concave-cost network flow problems: Applications, complexity and algorithms," Annals Oper. Res., vol. 25, pp. 75-100, 1990.
12. M. Gen and Y. Li, "Spanning tree-based genetic algorithm for the bi-criteria fixed charge transportation problem," Proc. 1999 IEEE Congr. Evolutionary Computation, pp. 2265-2271, 1999.
13. 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.
14. P. Piggott and F. Suraweera, "Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem," in Progress in Evolutionary Computation, X. Yao, Ed. New York: Springer, 1995, vol. 956, LNAI, pp. 305-314.
15. A. Cayley, "A theorem on trees," Quart. J. Math., vol. 23, pp. 376-378, 1889.
16. L. Berry, B. Murtagh, and S. Sugden, "A genetic-based approach to tree network synthesis with cost constraints," in Proc. 2nd Eur. Congr. Intelligent Techniques and Soft Computing, H. Zimmermann, Ed., Aachen, Germany, 1994, pp. 626-629.
17. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," Proc. 1st IEEE Conf. Evolutionary Computation, pp. 379-384, 1994.
18. M. Krishnamoorthy and A. T. Ernst, "Comparison of algorithms for the degree constrained minimum spanning tree," J. Heuristics, vol. 7, pp. 587-611, 2001.
19. 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. J. Eshelman, Ed., 1995, pp. 470-477.
20. C.-H. Chu, G. Premkumar, C. Chou, and J. Sun, "Dynamic degree constrained network design: A genetic algorithm approach," in Proc. 1999 Genetic and Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds., 1999, pp. 141-148.
21. L. Berry, B. Murtagh, S. Sugden, and G. McMahon, "Application of a genetic-based algorithm for optimal design of tree-structured communication networks," in Proc. Regional Teletraffic Engineering Conf. Int. Teletraffic Congress, Pretoria, South Africa, 1995, pp. 361-370.
22. H. Chou, G. Premkumar, and C.-H. Chu, "Genetic algorithms for communications network design-An empirical study of the factors that influence performance," IEEE Trans. Evol. Comput., vol. 5, pp. 236-249, June 2001.
23. S. Even, Algorithmic Combinatorics. New York: Macmillan, 1973.
24. H. Prüfer, "Neuer beweis eines satzes über permutationen," Archiv für Mathematik und Physik, vol. 27, pp. 141-144, 1918.
25. J. Knowles and D. Corne, "A new evolutionary approach to the degree constrained minimum spanning tree problem," IEEE Trans. Evol. Comput., vol. 4, pp. 125-134, Apr. 2000.
26. F. Rothlauf and D. Goldberg, "Pruefernumbers and genetic algorithms: A lesson how the low locality of an encoding can harm the performance of GA's," in Parallel Problem Solving from Nature-PPSN VI, K. Deb, G. Rodolph, X. Yao, and H.-P. Schwefel, Eds. New York: Springer, 2000, vol. 1917, LNCS, pp. 395-404.
27. G. Zhou and M. Gen, "Approach to degree-constrained minimum spanning tree problem using genetic algorithm," Eng. Des. & Automat., vol. 3, no. 2, pp. 157-165, 1997.
28. J. R. Kim and M. Gen, "Genetic algorithm for solving bicriteria network topology design problem," in Proc. 1999 Congress Evolutionary Computation. New York: IEEE Press, 1999, pp. 2272-2279.
29. 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. 2001 Genetic and Evolutionary Computation Conf., L. Spector, E. Goodham, A Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, Eds., 2000, pp. 343-350.
30. S. Picciotto, "How to encode a tree," Ph.D. dissertation, Univ. of California, San Diego, 1999.
31. N. Deo and P. Micikevicius, "Comparison of Prüfer-like codes for labeled trees," in Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory, and Computing, Baton Rouge, LA, 2001.
32. B. A. Julstrom, "The Blob code: A better string coding of spanning trees for evolutionary search," in 2001 Genetic and Evolutionary Computation Conf. Workshop Program, R. Heckendorn, Ed., San Francisco, CA, 2001, pp. 256-261.
33. T. Gaube and F. Rothlauf, "The link and node biased encoding revisited: Bias and adjustment of parameters," in Applic. Evolut. Comput.: EvoWorkshops 2001, E. J. W. Boers et al., Eds. Berlin, Germany: Springer, vol. 2037, LNCS, pp. 1-10.
34. 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. Applied Computing, J. Carroll, E. Damiani, H. Haddad, and D. Oppenheim, Eds., 2000, pp. 440-445.
35. J. C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Comput., vol. 6, no. 2, pp. 154-160, 1994.
36. F. Rothlauf, D. Goldberg, and A. Heinzl, "Bad codings and the utility of well-designed genetic algorithms," in Proc. 2000 Genetic and Evolutionary Computation Conf., D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, Eds., 2000, pp. 355-362.
37. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms. Heidelberg, Germany: Physica, 2002, Studies in Fuzziness and Soft Computing.
38. G. Schindler, F. Rothlauf, and H.-J. Pesch, "Evolution strategies, network random keys, and the one-max tree problem," in Applications of Evolutionary Computing: EvoWorkshops 2002, S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, and G. R. Raidl, Eds. Berlin, Germany: Springer, 2002, vol. 2279, LNCS, pp. 143-152.
39. M. Gen, G. Zhou, and J. R. Kim, "Genetic algorithms for solving network design problems: State-of-the-art survey," Evolut. Optimiz., vol. 1, no. 2, pp. 121-141, 1999.
40. W. Edelson and M. Gargano, "Feasible encodings for GA solutions of constrained minimal spanning tree problems," in Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conf., 2000, pp. 82-89.
41. G. R. Raidl, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," Proc. 2000 IEEE Congress on Evolutionary Computation, pp. 104-111, 2000.
42. B. A. Julstrom, "Encoding rectilinear Steiner trees as lists of edges," in Proc. 16th ACM Symp. Applied Computing, 2001, pp. 356-360.
43. Y. Li and Y. Bouchebaba, "A new genetic algorithm for the optimal communication spanning tree problem," in Proc. Artificial Evolution: 4th European Conf., vol. 1829, LNCS, C. Fonlupt, J.-K. Hao, E. Lutton, E. Ronald, and M. Schoenauer, Eds., 1999, pp. 162-173.
44. Y. Li, "An effective implementation of a direct spanning tree representation in GAs," in Applications of Evolutionary Computing: EvoWorkshops 2001, E. J. W. Boers et al., Eds., vol. 2037, LNCS, pp. 11-19.
45. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
46. G. R. Raidl and C. Drexel, "A predecessor coding in an evolutionary algorithm for the capacitated minimum spanning tree problem," in Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conf., 2000, pp. 309-316.
47. A. Guénoche, "Random spanning tree," J. Algorithms, vol. 2, pp. 214-220, 1983.
48. C. J. Colbourne, R. P. J. Day, and L. D. Nel, "Unranking and ranking spanning trees of a graph," J. Algorithms, vol. 10, no. 2, pp. 249-270, 1989.
49. A. Broder, "Generating random spanning trees," in IEEE 30th Annu. Symp. Foundations of Computer Science, 1989, pp. 442-447.
50. D. H. Ackley, A Connectionist Machine for Genetic Hill Climbing. Boston, MA: Kluwer, 1987.
51. F. Rothlauf, D. Goldberg, and A. Heinzl, "Network random keys-A tree network representation scheme for genetic and evolutionary algorithms," Evolut. Comput., vol. 10, no. 1, pp. 75-97, 2002.
52. F. Rothlauf and D. Goldberg, "Tree network design with genetic algorithms-An investigation in the locality of the Pruefernumber encoding," in Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conf., S. Brave and A. S. Wu, Eds., Orlando, FL, 1999, pp. 238-243.
53. B. A. Julstrom and G. R. Raidl et al., "Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges," in Proc. 2002 ACM Symp. Applied Computing, G. Lamont et al., Eds., 2002, pp. 547-552.
54. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: New W. H. Freeman, 1979.
55. C. Monma and S. Suri, "Transitions in geometric minimum spanning trees," Discrete and Comput. Geom., vol. 8, no. 3, pp. 265-293, 1992.
56. C. H. Papadimitriou and U. V. Vazirani, "On two geometric problems related to the traveling salesman problem," J. Algorithms, vol. 5, pp. 231-246, 1984.
57. 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.
58. M. Savelsbergh and T. Volgenant, "Edge exchanges in the degree-constrained minimum spanning tree problem," Comput. Oper. Res., vol. 12, no. 4, pp. 341-348, 1985.
59. B. A. Julstrom and G. R. Raidl, "Weight-biased edge-crossover in evolutionary algorithms for two graph problems," in Proc. 16th ACM Symp. Applied Computing, 2001, pp. 321-326.