During the course, you will find here the documents for the theoretical and practical exercises.
The Pure Random Search (PRS) and the (1+1)EA are some of the simplest randomized search heuristics which are simple enough to understand their behaviour theoretically on simple functions. In this exercise, we investigate their ability to optimize the ONEMAX function---both experimentally and theoretically.
The goal of this exercise is to showcase how easy it is to implement an evolutionary algorithm from scratch for the traveling salesperson problem (TSP) and understand its basic working principles and their influence on the algorithm performance.
In this exercise, we plan to implement a simple weighted sum and benchmark it on the bbob-biobj-ext suite of the COCO platform.
This exercise consists of several questions around adaptive stepsize algorithms and CMA-ES in particular.