Exercises for Chapter Ten: Memetic Algorithms

  1. Describe how the use of Lamarckian and Baldwinian versions of
    local search methods in memetic algorithms change the size of
    the search space explored by the underlying EA.
  2. Implement a simple memetic algorithm using a single iteration
    of a bit-flipping local search within the code for the SGA you
    developed for OneMax in Chapter 3. Before you run the
    experiment, justify whether you think steepest or greedy
    ascent will be most efficient on this problem.

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