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.
5.<br />
6.<br />
Derive the requirements for rank selection given in the subsection on rank selection: 1 dMaxd2 and<br />
Min = 2Max.<br />
Derive the expressions Exp Val[i] and Exp Val[i] for the minimum and the maximum number<br />
of times an individual will reproduce under SUS.<br />
In the discussion on messy GAs, it was noted that Goldberg et al. explored a "probabilistically<br />
complete initialization" scheme in which they calculate what pairs of l' and ng will ensure that, on<br />
average, each schema of order k will be present in the initial population. Give examples of l' and ng<br />
that will guarantee this for k = 5.<br />
COMPUTER EXERCISES<br />
1.<br />
Implement SUS and use it on the fitness function described in computer exercise 1 in chapter 1. How<br />
does this GA differ in behavior from the original one with roulette−wheel selection? Measure the<br />
"spread" (the range of possible actual number of offspring, given an expected number of offspring) of<br />
both sampling methods.<br />
2.<br />
Implement a GA with inversion and test it on Royal Road function R1. Is the performance improved?<br />
3.<br />
4.<br />
5.<br />
6.<br />
Design a fitness function on which you think inversion will be helpful, and compare the performance<br />
of the GA with and without inversion on that fitness function.<br />
Implement Schaffer and Morishima's crossover template method and see if it improves the GA's<br />
performance on R1. Where do the exclamation points end up?<br />
Design a fitness function on which you think the crossover template method should help, and compare<br />
the performance of the GA with and without crossover templates on that fitness function.<br />
Design a fitness function on which you think uniform crossover should perform better than one−point<br />
or two−point crossover, and test your hypothesis.<br />
7.<br />
Compare the performance of GAs using one−point, two−point, and uniform crossover on R1.<br />
8.<br />
9.<br />
Chapter 4: Theoretical Foundations of <strong>Genetic</strong> <strong>Algorithms</strong><br />
Compare the performance of GAs using the various selection methods described in this chapter, using<br />
R1 as the fitness function. Which results in the best performance?<br />
133