Network design through forests with degree- and role-constrained minimum spanning trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problem instances which we optimize using different evolutionary computation algorithms encoding individuals of the population using the proposed representation. To illustrate the applicability of our approach, we formulate the trans-European transport network as a DRCMST problem. In this network design, we simultaneously optimize nine transport corridors and show that it is straightforward using the proposed representation to add constraints depending on the specific characteristics of the network.

[1]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design , 2004, GECCO.

[2]  Alexandre C. B. Delbem,et al.  Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design , 2012, IEEE Transactions on Evolutionary Computation.

[3]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..

[4]  Gilbert Syswerda,et al.  A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.

[5]  J. A. Lozano,et al.  Sampling and Learning Mallows and Generalized Mallows Models Under the Cayley Distance , 2018 .

[6]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[7]  G. Hommel,et al.  Improvements of General Multiple Test Procedures for Redundant Systems of Hypotheses , 1988 .

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

[9]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  Bryant A. Julstrom,et al.  Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..

[12]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[13]  Alexander Mendiburu,et al.  Introducing the Mallows Model on Estimation of Distribution Algorithms , 2011, ICONIP.

[14]  Alexander Mendiburu,et al.  A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems , 2012, Progress in Artificial Intelligence.

[15]  Concha Bielza,et al.  Towards optimal neuronal wiring through estimation of distribution algorithms , 2013, GECCO.

[16]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[17]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

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

[19]  José A. Gámez,et al.  Tackling the rank aggregation problem with evolutionary algorithms , 2013, Appl. Math. Comput..

[20]  Concha Bielza,et al.  Multidimensional statistical analysis of the parameterization of a genetic algorithm for the optimal ordering of tables , 2010, Expert Syst. Appl..

[21]  C. L. Mallows.  NON-NULL RANKING MODELS. I , 1957 .

[22]  Alexander Mendiburu,et al.  Kernels of Mallows Models for Solving Permutation-based Problems , 2015, GECCO.

[23]  Alexander Mendiburu,et al.  A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem , 2014, IEEE Transactions on Evolutionary Computation.

[24]  Shigeyoshi Tsutsui,et al.  Node Histogram vs. Edge Histogram: A Comparison of Probabilistic Model-Building Genetic Algorithms in Permutation Domains , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[25]  M. Friedman.  The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance , 1937 .

[26]  J. Wojciechowski,et al.  Tree-based access network design under requirements for an aggregation network , 2009 .

[27]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[28]  David W. Corne,et al.  A New Encoding for the Degree Constrained Minimum Spanning Tree Problem , 2004, KES.

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

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

[31]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[32]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

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