Assignment 3
Assignment 3
CS 256
due November 12, 1998
150 points
For 25 points each, up to a maximum of 150 points, investigate
modifying the simple genetic algorithms given in the files
genetic.drs and genetic.drs
the following ways:
- by modifying the function
initial-population
that generates the initial population
- by modifying the fitness function (e.g., to get a more
reasonable definition of fitness, or so that it rewards simpler
individuals)
- by adding mutation operators
- by changing the tradeoff between population size,
number of runs, and number of generations per run (while
keeping the product of these three values constant)
- by extending the test data (e.g, by adding new
planets in the first application, or varying the length n
of the bit strings in the second application)
- by modifying the probability of crossover
- by introducing operators to simplify trees in the
populations
(e.g., by simplifying (mysqrt (mysquare x)) to x)
- by adding new labels for nodes (e.g., the numeric
constant 1)
You may do any of these operations for either or both of the
two applications.
For reproducibility, you may want to use a randomizer that can
be reseeded. Such a randomizer is provided in the two files
you are given, but this randomizer is not actually used in these
files.
In each case, report on the results of your modifications. Normally
such reports will include the best individual obtained in any
generation.
Turn in the code corresponding to each modification as a separate file.