Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees

Motivated by the telecommunication network design, we study the problem of finding diverse set of minimum spanning trees of a certain complete graph based on the two features which are maximum degree and diameter. In this study, we examine a simple multi-objective EA, GSEMO, in solving the two problems where we maximise or minimise the two features at the same time. With a rigorous runtime analysis, we provide understanding of how GSEMO optimize the set of minimum spanning trees in these two different feature spaces.

[1]  Luís Gouveia,et al.  Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees , 2003, Networks.

[2]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[3]  Oliver Giel,et al.  Expected runtimes of a simple multi-objective evolutionary algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[4]  Wanru Gao,et al.  Runtime analysis for maximizing population diversity in single-objective optimization , 2014, GECCO.

[5]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

[7]  Hebert Pérez-Rosés,et al.  The Maximum Degree & Diameter-Bounded Subgraph and its Applications , 2012, J. Math. Model. Algorithms.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[9]  Nachol Chaiyaratana,et al.  Effects of diversity control in single-objective and multi-objective genetic algorithms , 2007, J. Heuristics.

[10]  Marco Laumanns,et al.  A Tutorial on Evolutionary Multiobjective Optimization , 2004, Metaheuristics for Multiobjective Optimisation.

[11]  Rasmus K. Ursem,et al.  Diversity-Guided Evolutionary Algorithms , 2002, PPSN.

[12]  Jeffrey S. Salowe,et al.  Low-degree minimum spanning trees , 1995, Discret. Comput. Geom..

[13]  Amitabh Sinha,et al.  Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem , 2005, Algorithmica.

[14]  V. S. Anil Kumar,et al.  Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[15]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[16]  Wanru Gao,et al.  Feature-Based Diversity Optimization for Problem Instance Classification , 2015, Evolutionary Computation.

[17]  Thang Nguyen Bui,et al.  An ant-based algorithm for finding degree-constrained minimum spanning tree , 2006, GECCO.

[18]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[19]  Markus Wagner,et al.  Discrepancy-based evolutionary diversity optimization , 2018, GECCO.