Reference : Expected Running Time of Parallel Evolutionary Algorithms on Unimodal Pseudo-Boolean ...

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/12625

Title :	Expected Running Time of Parallel Evolutionary Algorithms on Unimodal Pseudo-Boolean Functions over Small-World Networks
Language :	English
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)]
Publication date :	2013
Main document title :	Proc. of the IEEE Congress on Evolutionary Computation (CEC'2013)
Publisher :	IEEE
Peer reviewed :	Yes
Audience :	International
City :	Cancún, Mexico
Event name :	Proc. of the IEEE Congress on Evolutionary Computation (CEC’2013)
Event date :	2013-06
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 centres :	University of Luxembourg: High Performance Computing - ULHPC
Permalink :	http://hdl.handle.net/10993/12625

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access CEC2013.pdf Publisher postprint 347.68 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map