Exercises for Chapter Nine: Working with Evolutionary Algorithms

  1. Consider using the number of generations as a measure to establish
    the speed of an EA. Compare the use of this measure with using the number of fitness evaluations.

  3. Provide the derivation for Equation 9.1 which gives the number of independent runs needed to find a solution by generation i with a probability of z
  4. Design a crossover operator that generalises one point crossover
    for an arbitrary number of parents. Make an experimental plan to assess the value of this operator within a GA on 3-SAT problems. Do not forget to include tests with respect to the number of parents.
  5. Carry out the plan you made above and report on your findings.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

The on-line accompaniment to the book Introduction to Evolutionary Computing