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 />
turn activate the output units via the same procedure. Use Montana and Davis's method <strong>to</strong> evolve weights wi, j<br />
(0 d wi, j d 1) and thresholds Ãj (0dÃjd1) <strong>to</strong> solve this problem. Put the wi,j values on the same chromosome.<br />
(The dj values are ignored by the input nodes, which are always set <strong>to</strong> 0 or 1.) The fitness of a chromosome is<br />
the average sum of the squares of the errors (differences between the output and input patterns at each<br />
position) over the entire training set. How well does the GA succeed? For the very ambitious reader: Compare<br />
the performance of the GA with that of back−propagation (Rumelhart, Hin<strong>to</strong>n, and Williams 1986a) in the<br />
same way that Montana and Davis did. (This exercise is intended for those already familiar with neural<br />
networks.)<br />
64