Multiobjective EA Approach for Improved Quality of Solutions for Spanning Tree Problem

The problem of computing spanning trees along with specific constraints is mostly NP-hard. Many approximation and stochastic algorithms which yield a single solution, have been proposed. In this paper, we formulate the generic multi-objective spanning tree (MOST) problem and consider edge-cost and diameter as the two objectives. Since the problem is hard, and the Pareto-front is unknown, the main issue in such problem-instances is how to assess the convergence. We use a multiobjective evolutionary algorithm (MOEA) that produces diverse solutions without needing a priori knowledge of the solution space, and generate solutions from multiple tribes in order to assess movement of the solution front. Since no experimental results are available for MOST, we consider three well known diameter-constrained minimum spanning tree (dc-MST) algorithms including randomized greedy heuristics (RGH) which represents the current state of the art on the dc-MST, and modify them to yield a (near-) optimal solution-fronts. We quantify the obtained solution fronts for comparison. We observe that MOEA provides superior solutions in the entire-range of the Pareto-front, which none of the existing algorithms could individually do.

[1]  Narsingh Deo,et al.  Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine , 1996, Parallel Comput..

[2]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[3]  Ayman M. Abdalla,et al.  Computing a diameter-constrained minimum spanning tree , 2001 .

[4]  Kalyanmoy Deb,et al.  Running performance metrics for evolutionary multi-objective optimizations , 2002 .

[5]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

[6]  Rolf Drechsler,et al.  Applications of Evolutionary Computing , 2004, Lecture Notes in Computer Science.

[7]  Randeep Bhatia,et al.  Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997) , 1998, SIGA.

[8]  Joshua D. Knowles,et al.  A comparison of encodings and algorithms for multiobjective minimum spanning tree problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[9]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[10]  Rajeev Kumar,et al.  Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Genetic Algorithm , 2002, Evolutionary Computation.

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

[12]  Viktor K. Prasanna,et al.  High Performance Computing - HiPC 2004 , 2004, Lecture Notes in Computer Science.

[13]  Gary B. Lamont,et al.  Applications Of Multi-Objective Evolutionary Algorithms , 2004 .

[14]  Jason R. Schott.  Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[15]  Narsingh Deo,et al.  Constrained spanning tree problems: Approximate methods and parallel computation , 1997, Network Design: Connectivity and Facilities Location.

[16]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[17]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[18]  Rajeev Kumar,et al.  Assessing the convergence of rank-based multiobjective genetic algorithms , 1997 .

[19]  Mitsuo Gen,et al.  Genetic algorithm approach on multi-criteria minimum spanning tree problem , 1999, Eur. J. Oper. Res..

[20]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[21]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[22]  P. P. Chakrabarti,et al.  Multiobjective Genetic Search for Spanning Tree Problem , 2004, ICONIP.

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

[24]  M. Hansen,et al.  Evaluating the quality of approximations to the non-dominated set , 1998 .

[25]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[26]  Bryant A. Julstrom,et al.  Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem , 2003, SAC '03.

[27]  R. Ravi,et al.  Bicriteria Network Design Problems , 1998, J. Algorithms.

[28]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[29]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithm test suites , 1999, SAC '99.

[30]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[31]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[32]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[33]  Narsingh Deo,et al.  Computing a Diameter-Constrained Minimum Spanning Tree in Parallel , 2000, CIAC.

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

[35]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

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

[37]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[38]  David W. Corne,et al.  A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems , 2004, PPSN.

[39]  P. P. Chakrabarti,et al.  Improved Quality of Solutions for Multiobjective Spanning Tree Problem Using Distributed Evolutionary Algorithm , 2004, HiPC.

[40]  P. J. Fleming,et al.  Elitism, Sharing and Ranking Choices in Evolutionary Multi-Criterion Optimisation , 2002 .