Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem
- Authors
- Lai, Xinsheng; Zhou, Yuren; He, Jun; Zhang, Jun
- Issue Date
- Dec-2014
- Publisher
- Institute of Electrical and Electronics Engineers
- Keywords
- Approximation ratio; evolutionary algorithm; minimum label spanning tree; multiobjective; runtime complexity
- Citation
- IEEE Transactions on Evolutionary Computation, v.18, no.6, pp 860 - 872
- Pages
- 13
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Evolutionary Computation
- Volume
- 18
- Number
- 6
- Start Page
- 860
- End Page
- 872
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116160
- DOI
- 10.1109/TEVC.2013.2291790
- ISSN
- 1089-778X
1941-0026
- 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 ln n+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.
- Files in This Item
-
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116160)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.