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

Xinsheng Lai, Yuren Zhou, Jun He, Jun Zhang

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)
136 Downloads (Pure)

Abstract

A few 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. In this paper, we theoretically analyze the performances of the (1+1) EA, a simple version of EA, and a simple multiobjective evolutionary algorithm called GSEMO on the MLST problem. We reveal that for the MLSTb problem, the (1+1) EA and GSEMO achieve a (b + 1)/2-approximation ratio in expected polynomial runtime with respect to n, the number of nodes, and k, the number of labels. We also find that GSEMO achieves a (2 lnn+1)-approximation ratio for the MLST problem in expected polynomial runtime with respect to 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.
Original languageEnglish
Pages (from-to)860-872
JournalIEEE Transactions on Evolutionary Computation
Volume18
Issue number6
DOIs
Publication statusPublished - 20 Nov 2013

Fingerprint

Dive into the research topics of 'Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem'. Together they form a unique fingerprint.

Cite this