Evolutionary Computation

Due: Tuesday, 19 November 2019 at the beginning of class

- Follow the general homework directions.
- Make sure you cite all your references and contacts.

- Read
- Chapter 11, 12, and 13 in textbook.

- Problems
- 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.
- Describe the main components necessary to add to a "standard" EA in order to tackle a multiobjective problem.
- What is a nondominated point?
- A simple multiobjective problem has two objective functions f
_{1}(x_{1})=x_{1}and f_{2}(x_{2})=x_{2}^{3}and is subject to the constraints x_{1}^{2}+ x_{2}^{2}<=10. What will the Pareto front for this problem look like?