diff options
| author | Alvaro Herrera | 2019-08-19 16:05:38 +0000 |
|---|---|---|
| committer | Alvaro Herrera | 2019-08-19 16:05:38 +0000 |
| commit | 28b6ec1df64775db6d6eb47655141cda1240d901 (patch) | |
| tree | 5564bfab21fe3ded4e06d1c80c8065e29f2c6de8 /doc/src/sgml/geqo.sgml | |
| parent | a407012c07844b5d81012d6960c4b2ec11d6af9c (diff) | |
Replace genetic algorithm ASCII-art with a real figure
Author: Jürgen Purtz
Discussion: https://postgr.es/m/[email protected]
Diffstat (limited to 'doc/src/sgml/geqo.sgml')
| -rw-r--r-- | doc/src/sgml/geqo.sgml | 55 |
1 files changed, 11 insertions, 44 deletions
diff --git a/doc/src/sgml/geqo.sgml b/doc/src/sgml/geqo.sgml index 5120dfbb424..39d2163d160 100644 --- a/doc/src/sgml/geqo.sgml +++ b/doc/src/sgml/geqo.sgml @@ -84,9 +84,19 @@ Through simulation of the evolutionary operations <firstterm>recombination</firstterm>, <firstterm>mutation</firstterm>, and <firstterm>selection</firstterm> new generations of search points are found - that show a higher average fitness than their ancestors. + that show a higher average fitness than their ancestors. <xref linkend="geqo-figure"/> + illustrates these steps. </para> + <figure id="geqo-figure"> + <title>Structure of a Genetic Algorithm</title> + <mediaobject> + <imageobject> + <imagedata fileref="images/genetic-algorithm.svg" format="SVG" width="100%"/> + </imageobject> + </mediaobject> + </figure> + <para> According to the <systemitem class="resource">comp.ai.genetic</systemitem> <acronym>FAQ</acronym> it cannot be stressed too strongly that a <acronym>GA</acronym> is not a pure random search for a solution to a @@ -94,49 +104,6 @@ non-random (better than random). </para> - <figure id="geqo-diagram"> - <title>Structured Diagram of a Genetic Algorithm</title> - - <informaltable frame="none"> - <tgroup cols="2"> - <tbody> - <row> - <entry>P(t)</entry> - <entry>generation of ancestors at a time t</entry> - </row> - - <row> - <entry>P''(t)</entry> - <entry>generation of descendants at a time t</entry> - </row> - </tbody> - </tgroup> - </informaltable> - -<literallayout class="monospaced"> -+=========================================+ -|>>>>>>>>>>> Algorithm GA <<<<<<<<<<<<<<| -+=========================================+ -| INITIALIZE t := 0 | -+=========================================+ -| INITIALIZE P(t) | -+=========================================+ -| evaluate FITNESS of P(t) | -+=========================================+ -| while not STOPPING CRITERION do | -| +-------------------------------------+ -| | P'(t) := RECOMBINATION{P(t)} | -| +-------------------------------------+ -| | P''(t) := MUTATION{P'(t)} | -| +-------------------------------------+ -| | P(t+1) := SELECTION{P''(t) + P(t)} | -| +-------------------------------------+ -| | evaluate FITNESS of P''(t) | -| +-------------------------------------+ -| | t := t + 1 | -+===+=====================================+ -</literallayout> - </figure> </sect1> <sect1 id="geqo-pg-intro"> |