A comparison of encodings and algorithms for multiobjective minimum spanning tree problems

Finding minimum-weight spanning trees (MST) in graphs is a classic problem in operations research with important applications in network design. The basic MST problem can be solved efficiently, but the degree constrained and multiobjective versions are NP-hard. Current approaches to the degree-constrained single objective MST include Raidl's (2000) evolutionary algorithm (EA) which employs a direct tree encoding and associated operators, and Knowles and Corne's (2000) encoding based on a modified version of Prim's (1957) algorithm. Approaches to the multiobjective MST include various approximate constructive techniques from operations research, along with Zhou and Gen's (1999) evolutionary algorithm using a Prufer (1918) based encoding. We apply (appropriately modified) the best of recent methods for the (degree-constrained) single objective MST problem to the multiobjective MST problem, and compare with a method based on Zhou and Gen's approach. Our evolutionary computation approaches, using the different encodings, involve a new population-based variant of Knowles and Corne's PAES algorithm. We find the direct encoding to considerably outperform the Prufer encoding. We find that a simple iterated approach, based on Prim's algorithm modified for the multiobjective MST, also significantly outperforms the Prufer encoding.

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

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

[3]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[4]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[5]  Robin J. Wilson.  Graphs : an introductory approach : a first course in discrete mathematics / Robin J. Wilson, John J. Watkins , 1989 .

[6]  Algorithms and data structures , 1990 .

[7]  Horst W. Hamacher,et al.  On spanning tree problems with multiple objectives , 1994, Ann. Oper. Res..

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

[9]  M. Ehrgott,et al.  Connectedness of efficient solutions in multiple criteria combinatorial optimization , 1997 .

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

[11]  S. Alonso,et al.  The problem of the optimal biobjective spanning tree , 1998, Eur. J. Oper. Res..

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

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

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

[15]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[16]  Martin J. Oates,et al.  On the Assessment of Multiobjective Approaches to the Adaptive Distributed Database Management Problem , 2000, PPSN.

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

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

[19]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[20]  David W. Corne,et al.  Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm , 2002, Eur. J. Oper. Res..