Edge sets: an effective evolutionary coding of spanning trees

The fundamental design choices in an evolutionary algorithm (EA) are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in EAs for network design problems directly as sets of their edges and we describe initialization, recombination, and mutation operators for this representation. The operators offer locality, heritability, and computational efficiency. Initialization and recombination depend on an underlying random spanning-tree algorithm. Three choices for this algorithm, based on the minimum spanning-tree algorithms of Prim and Kruskal and on random walks, respectively, are examined analytically and empirically. We demonstrate the usefulness of the edge-set encoding in an EA for the NP-hard degree-constrained minimum spanning-tree problem. The algorithm's operators are easily extended to generate only feasible spanning trees and to incorporate local, problem-specific heuristics. Comparisons of this algorithm to others that encode candidate spanning trees via the Blob Code, with network random keys, and as strings of weights indicate the superiority of the edge-set encoding, particularly on larger instances.

[1]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[3]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[4]  L. R. Esau,et al.  On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..

[5]  A. Phillips.  The macmillan company. , 1970, Analytical chemistry.

[6]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[7]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Subhash C. Narula,et al.  Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..

[10]  Alain Guénoche.  Random Spanning Tree , 1983, J. Algorithms.

[11]  Christos H. Papadimitriou,et al.  On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[12]  Martin W. P. Savelsbergh,et al.  Edge exchanges in the degree-constrained minimum spanning tree problem , 1985, Comput. Oper. Res..

[13]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[14]  Jan Karel Lenstra,et al.  The Parallel Complexity of TSP Heuristics , 1989, J. Algorithms.

[15]  Charles J. Colbourn,et al.  Unranking and Ranking Spanning Trees of a Graph , 1989, J. Algorithms.

[16]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[17]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[18]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

[19]  Lawrence Davis,et al.  A Genetic Algorithm for Survivable Network Design , 1993, International Conference on Genetic Algorithms.

[20]  Francis Suraweera,et al.  Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem , 1994, Evo Workshops.

[21]  Charles C. Palmer,et al.  Representing trees in genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[22]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[23]  Roger L. Wainwright,et al.  Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem , 1995, ICGA.

[24]  G. Zhou,et al.  Approach to Degree Constrained Minimum Spanning Tree Problem Using Genetic Algorithm , 1997 .

[25]  Samir Khuller,et al.  A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees , 1996, J. Algorithms.

[26]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[27]  D. Goldberg,et al.  Tree network design with genetic algorithms an investigation in the locality of the pruefernumber en , 1999 .

[28]  Mitsuo Gen,et al.  Genetic algorithm for solving bicriteria network topology design problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[29]  Yu Li,et al.  A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem , 1999, Artificial Evolution.

[30]  Jianzhong Sun,et al.  Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach , 1999, GECCO.

[31]  Franz Rothlauf,et al.  Bad Codings and the Utility of Well-Designed Genetic Algorithms , 2000, GECCO.

[32]  Franz Rothlauf,et al.  Network random keys-a tree network representation scheme for genetic and evolutionary algorithms , 2000 .

[33]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[34]  G. Raidl.  An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[35]  Michael L. Gargano,et al.  Feasible Encodings for GA Solutions of constrained Minimal Spanning Tree Problems , 2000, GECCO.

[36]  Bryant A. Julstrom,et al.  A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem , 2000, SAC '00.

[37]  Mitsuo Gen,et al.  A Genetic Algorithm for Solving Bicriteria Network Topology Design Problems , 2000 .

[38]  David W. Corne,et al.  A new evolutionary approach to the degree-constrained minimum spanning tree problem , 1999, IEEE Trans. Evol. Comput..

[39]  Mitsuo Gen,et al.  Spanning tree-based genetic algorithm for the bicriteria fixed charge transportation problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[40]  Franz Rothlauf,et al.  Pruefer Numbers and Genetic Algorithms: A Lesson on How the Low Locality of an Encoding Can Harm the Performance of GAs , 2000, PPSN.

[41]  Andreas T. Ernst,et al.  Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.

[42]  G. Raidl,et al.  Prüfer numbers: a poor representation of spanning trees for evolutionary search , 2001 .

[43]  Narsingh Deo.  Prüfer-Like Codes for Labeled Trees , 2001 .

[44]  Chao-Hsien Chu,et al.  Genetic algorithms for communications network design - an empirical study of the factors that influence performance , 2001, IEEE Trans. Evol. Comput..

[45]  Bryant A. Julstrom,et al.  Weight-biased edge-crossover in evolutionary algorithms for two graph problems , 2001, SAC.

[46]  Yu Li,et al.  An Effective Implementation of a Direct Spanning Tree Representation in GAs , 2001, EvoWorkshops.

[47]  Franz Rothlauf,et al.  The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters , 2001, EvoWorkshops.

[48]  Bryant A. Julstrom.  Encoding rectilinear Steiner trees as lists of edges , 2001, SAC.

[49]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[50]  Franz Rothlauf,et al.  Network Random KeysA Tree Representation Scheme for Genetic and Evolutionary Algorithms , 2002, Evolutionary Computation.

[51]  Günther R. Raidl,et al.  A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem , 2002 .

[52]  Franz Rothlauf,et al.  Evolution Strategies, Network Random Keys, and the One-Max Tree Problem , 2002, EvoWorkshops.

[53]  Bryant A. Julstrom,et al.  Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges , 2002, SAC '02.