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
  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. Describe the main components necessary to add to a "standard" EA in order to tackle a multiobjective problem.
  3. What is a nondominated point?
  4. A simple multiobjective problem has two objective functions f₁(x₁)=x₁ and f₂(x₂)=x₂³ and is subject to the constraints x₁² + x₂²<=10. What will the Pareto front for this problem look like?