Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Expected Running Time of Parallel Evolutionary Algorithms on Unimodal Pseudo-Boolean Functions over Small-World Networks
Muszynski, Jakub; Varrette, Sébastien; Bouvry, Pascal
2013In Proc. of the IEEE Congress on Evolutionary Computation (CEC'2013)
Peer reviewed
 

Files


Full Text
CEC2013.pdf
Publisher postprint (356.02 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Abstract :
[en] 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 speed- up demonstrated in this article and prove the benefit that pEA can gain from a small-world network topology.
Research center :
ULHPC - University of Luxembourg: High Performance Computing
Disciplines :
Computer science
Author, co-author :
Muszynski, Jakub ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Varrette, Sébastien ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Bouvry, Pascal ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Language :
English
Title :
Expected Running Time of Parallel Evolutionary Algorithms on Unimodal Pseudo-Boolean Functions over Small-World Networks
Publication date :
2013
Event name :
Proc. of the IEEE Congress on Evolutionary Computation (CEC’2013)
Event date :
2013-06
Audience :
International
Main work title :
Proc. of the IEEE Congress on Evolutionary Computation (CEC'2013)
Publisher :
IEEE, Cancún, Mexico, Unknown/unspecified
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 06 December 2013

Statistics


Number of views
94 (1 by Unilu)
Number of downloads
1 (1 by Unilu)

Scopus citations®
 
0
Scopus citations®
without self-citations
0
WoS citations
 
0

Bibliography


Similar publications



Contact ORBilu