An Introduction to Genetic Algorithms - Boente
An Introduction to Genetic Algorithms - Boente
An Introduction to Genetic Algorithms - Boente
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Chapter 2: <strong>Genetic</strong> <strong>Algorithms</strong> in Problem Solving<br />
Figure 2.9: A space−time diagram of a GA−evolved rule for the task, and the same diagram with the<br />
regular domains filtered out, leaving only the particles and particle interactions (two of which are magnified).<br />
(Reprinted from Crutchfield and Mitchell 1994 by permission of the authors.)<br />
particle interactions <strong>to</strong> describe the temporal stages by which highly fit rules were evolved by the GA.<br />
Interestingly, it turns out that the behavior of the best rules discovered by the GA (such as Æd) is very similar<br />
<strong>to</strong> the behavior of the well−known Gacs−Kurdyumov−Levin (GKL) rule (Gacs, Kurdyumov, and Levin,<br />
1978; Gonzaga de Sá and Maes 1992). Figure 2.10 is a space−time diagram illustrating its typical behavior.<br />
The GKL rule (ÆGKL) was designed by hand <strong>to</strong> study reliable computation and phase transitions in<br />
one−dimensional spatially extended systems, but before we started our project it was also the rule with the<br />
best−known performance (for CAs with periodic boundary conditions) on the task. Its unbiased<br />
performance is given in the last row of table 2.1. The difference in performance between Æd and ÆGKL is due<br />
<strong>to</strong> asymmetries in Æd that are not present in ÆGKL. Further GA evolution of Æd (using an increased number of<br />
ICs) has produced an improved version that approximately equals the performance of the ÆGKL. Rajarshi Das<br />
(personal communication) has gone further and, using<br />
Figure 2.10: Space−time diagram for the GKL rule with<br />
the aforementioned particle analysis, has designed by hand a rule that slightly outperforms ÆGKL.<br />
The discovery of rules such as ÆbÆd is significant, since it is the first example of a GA's producing<br />
sophisticated emergent computation in decentralized, distributed systems such as CAs. It is encouraging for<br />
41