Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem

by   Xinsheng Lai, et al.
South China University of Technology International Student Union

Some experimental investigations have shown that evolutionary algorithms (EAs) are efficient for the minimum label spanning tree (MLST) problem. However, we know little about that in theory. As one step towards this issue, we theoretically analyze the performances of the (1+1) EA, a simple version of EAs, and a multi-objective evolutionary algorithm called GSEMO on the MLST problem. We reveal that for the MLST_b problem the (1+1) EA and GSEMO achieve a b+1/2-approximation ratio in expected polynomial times of n the number of nodes and k the number of labels. We also show that GSEMO achieves a (2ln(n))-approximation ratio for the MLST problem in expected polynomial time of n and k. At the same time, we show that the (1+1) EA and GSEMO outperform local search algorithms on three instances of the MLST problem. We also construct an instance on which GSEMO outperforms the (1+1) EA.


page 1

page 2

page 3

page 4


Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems

Theoretical studies on evolutionary algorithms have developed vigorously...

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem

A rigorous runtime analysis of evolutionary multi-objective optimization...

Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees

Given a ground set of items, the result diversification problem aims to ...

Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems

We study the multi-objective minimum weight base problem, an abstraction...

A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms

Bi-level optimisation problems have gained increasing interest in the fi...

On the approximation ability of evolutionary optimization with application to minimum set cover

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natur...

Please sign up or login with your details

Forgot password? Click here to reset