Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design

Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In general, these problems are NP-Hard. In order to deal with the complexity of these problems, some alternative strategies have been proposed. Approaches using evolutionary algorithms have achieved relevant results. However, the graph encoding is critical for the performance of such approaches in network design problems. Aiming to overcome this drawback, alternative representations of spanning trees have been developed. This article proposes an encoding for generation of spanning forests by evolutionary algorithms. The proposal is evaluated for degree-constrained minimum spanning tree problem.

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

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

[3]  M. Gen,et al.  Solving Multi-objective Transportation Problems by Spanning Tree-based Genetic Algorithm , 1998 .

[4]  Edgar G. Goodaire,et al.  Discrete Mathematics With Graph Theory , 1997 .

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

[6]  Alexandre C. B. Delbem,et al.  Optimal energy restoration in radial distribution systems using a genetic approach and graph chain representation , 2003 .

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

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

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

[10]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  A Forest Representation for Evolutionary Algorithms Applied to Network Design , 2003, GECCO.

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

[12]  Mitsuo Gen,et al.  A note on genetic algorithms for degree-constrained spanning tree problems , 1997, Networks.

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

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

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

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

[17]  Charles C. Palmer,et al.  An approach to a problem in network design using genetic algorithms , 1994, Networks.

[18]  L. Buydens,et al.  Using genetic algorithms for the construction of phylogenetic trees: application to G-protein coupled receptor sequences. , 1999, Bio Systems.

[19]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[20]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[21]  C. Pandu Rangan,et al.  Feedback vertex set on cocomparability graphs , 1995, Networks.

[22]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

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

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

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

[26]  Frank Harary,et al.  Dynamic graph models , 1997 .

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

[28]  Pedro M. S. Carvalho,et al.  On spanning-tree recombination in evolutionary large-scale network problems - application to electrical distribution planning , 2001, IEEE Trans. Evol. Comput..

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

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

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

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

[33]  Dirk Wiesmann,et al.  On Representation and Genetic Operators in Evolutionary Algorithms , 1998 .

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

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

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