Coarse-graining selection and mutation

Jonathan Rowe, MD Vose, AH Wright

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained.
Original languageEnglish
Pages (from-to)176-191
Number of pages16
JournalLecture Notes in Computer Science
Publication statusPublished - 1 Jan 2005
EventFoundations of Genetic Algorithms 8 (FOGA 2005) -
Duration: 1 Jan 2005 → …


Dive into the research topics of 'Coarse-graining selection and mutation'. Together they form a unique fingerprint.

Cite this