!!Projects per year
Crynodeb
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.
| Iaith wreiddiol | Saesneg |
|---|---|
| Rhif yr erthygl | 6670713 |
| Tudalennau (o-i) | 860-872 |
| Nifer y tudalennau | 13 |
| Cyfnodolyn | IEEE Transactions on Evolutionary Computation |
| Cyfrol | 18 |
| Rhif cyhoeddi | 6 |
| Dyddiad ar-lein cynnar | 20 Tach 2013 |
| Dynodwyr Gwrthrych Digidol (DOIs) | |
| Statws | Cyhoeddwyd - 01 Rhag 2014 |
Ôl bys
Gweld gwybodaeth am bynciau ymchwil 'Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.Prosiectau
- 1 Wedi Gorffen
-
Evolutionary Approximation Algorithms for Optimization: Algorithm design and Complexity Analysis
He, J. (Arweinydd y Prosiect)
Engineering and Physical Sciences Research Council (EPSRC)
01 Mai 2011 → 31 Hyd 2015
Prosiect: Ymchwil a ariannwyd yn allanol
Dyfynnu hyn
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver