| | |
Summary: Alternate GA Structures
Peter G. Anderson,
Computer Science Department
Rochester Institute of Technology,
Rochester, New York
anderson@cs.rit.edu http://www.cs.rit.edu/
February 2004
pg. 1
Abstract
Presenting
1. A student's version of the steady-state algorithm.
2. Generation-based GA.
pg. 2
Chris Brown's Idea (2003)
Maintain a population, as always.
Iteratively (until stopping criterion met):
· Randomly select two individuals
· Create a child using some crossover, and mutate the child (as always).
· Replace the population's worst element with the new child.
pg. 3
|
