Expected running time of parallel evolutionary algorithms on unimodal pseudo-boolean functions over small-world networks
| Autor: | Jakub Muszynski, Sébastien Varrette, Pascal Bouvry |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Random graph
Optimization problem Theoretical computer science Speedup Cost efficiency Computational complexity theory Computer science Evolutionary algorithm Parallel algorithm Graph theory Complex network Network topology Evolutionary computation Paradiseo Algorithm computer computer.programming_language |
| Zdroj: | IEEE Congress on Evolutionary Computation |
| DOI: | 10.1109/cec.2013.6557881 |
| Popis: | This paper proposes a theoretical and experimental analysis of the expected running time for an elitist parallel Evolutionary Algorithm (pEA) based on an island model executed over small-world networks. Our study assumes the resolution of optimization problems based on unimodal pseudo-boolean funtions. In particular, for such function with d values, we improve the previous asymptotic upper bound for the expected parallel running time from O(d√n) to O(d log n). This study is a first step towards the analysis of influence of more complex network topologies (like random graphs created by P2P networks) on the runtime of pEAs. A concrete implementation of the analysed algorithm have been performed on top of the ParadisEO framework and run on the HPC platform of the University of Luxembourg (UL). Our experiments confirm the expected speedup demonstrated in this article and prove the benefit that pEA can gain from a small-world network topology. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|