A statistical study of a class of cellular evolutionary algorithms

  • Authors:

  • Mathieu Capcarrère;Marco Tomassini;Andrea Tettamanzi;Moshe Sipper

  • Affiliations:

  • Logic Systems Laboratory Swiss Federal Institute of Technology 10I5 Lausanne, Switzerland Mathieu.Capcarrere@epfl.ch;Institute of Computer Science University of Lausanne 1015 Lausanne, Switzerland Marco.Tomassini@iismail.unil.ch;Department of Computer Science University of Milan Via Bramante 65, 26013 Crema (CR), Italy tettaman@dsi.unimi.it;Logic Systems Laboratory Swiss Federal Institute of Technology 1015 Lausanne, Switzerland Moshe.Sipper@epfl.ch

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Parallel evolutionary algorithms, over the past few years, have proven empirically worthwhile, but there seems to be a lack of understanding of their workings. In this paper we concentrate on cellular (fine-grained) models, our objectives being: (1) to introduce a suite of statistical measures, both at the genotypic and phenotypic levels, which are useful for analyzing the workings of cellular evolutionary algorithms; and (2) to demonstrate the application and utility of these measures on a specific example---the cellular programming evolutionary algorithm. The latter is used to evolve solutions to three distinct (hard) problems in the cellular-automata domain: density, synchronization, and random number generation. Applying our statistical measures, we are able to identify a number of trends common to all three problems (which may represent intrinsic properties of the algorithm itself, as well as a host of problem-specific features. We find that the evolutionary algorithm tends to undergo a number of phases which we are able to quantitatively delimit. The results obtained lead us to believe that the measures presented herein may prove useful in the general case of analyzing fine-grained evolutionary algorithms.