On the run-time dynamics of a peer-to-peer evolutionary algorithm

J.L.J. Laredo, A.E. Eiben, M. van Steen, J.J. Merelo

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)


In this paper we propose an improvement on a fully distributed Peer-to-Peer (P2P) Evolutionary Algorithm (EA) based on autonomous selection. Autonomous selection means that individuals decide on their own state of reproduction and survival without any central control, using instead estimations about the global population state for decision making. The population size varies at run-time as a consequence of such a decentralized reproduction and death of individuals. In order to keep it stable, we propose a self-adjusting mechanism which has been shown successful in three different search landscapes. Key are the estimations about fitness and size of the population as provided by a gossiping algorithm. Such an algorithm requires several rounds to collect the information while the individuals have to wait for synchronization. As an improvement, we propose a completely asynchronous EA which does not need waiting times. The results show that our approach outperforms quantitatively the execution time of the synchronous version.

Original languageEnglish
Title of host publicationParallel Problem Solving from Nature - PPSN X
Subtitle of host publication10th International Conference, Dortmund, Germany, September 13-17, 2008. Proceedings
EditorsGünter Rudolph, Thomas Jansen, Nicola Beume, Simon Lucas, Carlo Poloni
Place of PublicationBerlin, Heidelberg
Number of pages10
ISBN (Electronic)978-3-540-87700-4
ISBN (Print)978-3-540-87699-1
Publication statusPublished - 26 Nov 2008
Externally publishedYes
Event10th International Conference on Parallel Problem Solving from Nature, PPSN 2008 - Technische Universität Dortmund, Dortmund, Germany
Duration: 13 Sep 200817 Sep 2008
Conference number: 10

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Parallel Problem Solving from Nature, PPSN 2008
Abbreviated titlePPSN 2008
Internet address


  • Evolutionary algorithm
  • Tournament selection
  • Initial population size
  • Counting algorithm
  • Idle cycle


Dive into the research topics of 'On the run-time dynamics of a peer-to-peer evolutionary algorithm'. Together they form a unique fingerprint.

Cite this