Selection Intensity in Asynchronous Cellular Evolutionary Algorithms

  • Mario Giacobini
  • Enrique Alba
  • Marco Tomassini
Conference paper

DOI: 10.1007/3-540-45105-6_107

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2723)
Cite this paper as:
Giacobini M., Alba E., Tomassini M. (2003) Selection Intensity in Asynchronous Cellular Evolutionary Algorithms. In: Cantú-Paz E. et al. (eds) Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg

Abstract

This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a general model for asynchronous update of the individuals in a cellular EA, and by the necessity of better accuracy beyond what existing models of selection intensity can provide. Therefore, we investigate the differences between the expected and actual values of the selection pressure induced by several asynchronous update policies, and formally characterize the update dynamics of each variant of the algorithm. New models for these two issues are proposed, and are shown to be more accurate (lower fit error) than previous ones.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mario Giacobini
    • 1
  • Enrique Alba
    • 2
  • Marco Tomassini
    • 1
  1. 1.Computer Science InstituteUniversity of LausanneLausanneSwitzerland
  2. 2.Department of Computer ScienceUniversity of MálagaMálagaSpain

Personalised recommendations