# Evolutionary Algorithms I

The goal of the seminar is to experiment with the evolutionary algorithms and find out how they behave while solving simple tasks. To this end, we will use a simple Java library. Your goal will be to augment/create an operator to make the algorithm perform better. You will not need a deep understanding of Java - only the basics which are similar in most modern languages are required.

The source codes for the seminar are available at Github.

Submit the solutions to the assignments in Moodle.

## Credit requirements

There will be 12 lessons during the term. In each lesson, there will be an assignment and it will be possible to get 50 points for each assignment, i.e. 600 points for the whole term. Additionally, many of the assignments will contain bonus questions (e.g. for solving an extended version of the assignments, or for having a good solution compared to the rest of the class).

The deadline for the submission of the solution to the assignment will be 2 weeks after the lesson. In order to get the full amount of points, you need to submit the solution before the deadline. If you submit the solution less than two weeks after the deadline, you can still get half the points. Some of the bonus assignments will have shorter deadlines (typically one week).

In order to get the credit for the seminar, you need to have at least 400 points.

More detailed requirements for the solutions and a tutorial on the creation of plots is on a special page.

## Previous lessons

Date Tue | Date Thu | Topic |
---|---|---|

Oct. 2 | Oct. 4 | Simple Genetic Algorithm |

Oct. 9 | Oct. 11 | Bins I - Fitness and Selection |

Oct. 16 | Oct. 18 | Bins II - Informed Operators |