A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem

This article presents an evolutionary algorithm (EA) for the capacitated minimum spanning tree problem occurring in telecommunication applications. The EA encodes a solution by a predecessor vector indicating for each node the preceding node at the path to the given central root node. Initialization, crossover, and mutation operators were specifically designed to provide strong locality and to enable an effective search in the space of feasible solutions only. Furthermore, local heuristics are applied to promote the inclusion of low-cost links. Empirical results on a set of standard test problems indicate that the EA performs better than two other heuristic techniques.

[1]  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).

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

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

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

[5]  Leslie Hall,et al.  Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem , 1996, INFORMS J. Comput..

[6]  Erik Rolland,et al.  A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem , 1999, J. Heuristics.

[7]  Erik Rolland,et al.  Memory Adaptive Reasoning & Greedy Assignment Techniques for the Capacitated Minimum Spanning Tree Problem , 1999 .

[8]  Günther R. Raidl,et al.  On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms , 2002 .

[9]  Roger L. Wainwright,et al.  Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees , 1994, SAC '94.

[10]  R. EsauL.,et al.  On teleprocessing system design , 1966 .

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

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

[13]  Michel Gendreau,et al.  A TABU SEARCH ALGORITHM FOR THE CAPACITATED SHORTEST SPANNING TREE PROBLEM. , 1997 .

[14]  Stefan Voß,et al.  Capacitated minimum spanning trees: algorithms using intelligent search , 1995 .

[15]  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).

[16]  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.

[17]  Jeffrey H. Kingston.  Algorithms and data structures - design, correctness, analysis , 1990, International computer science series.

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

[19]  M. Gen,et al.  A note on genetic algorithms for degree‐constrained spanning tree problems , 1997 .

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

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

[22]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..