max planck institut
informatik
informatik
PD Dr. Benjamin Doerr, Dr. Nils Hebbinghaus and Dr. Frank Neumann
| Time: |
Tuesday 11-13. Start: October 17. |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Room: |
E1.4 R.023 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Content: |
Evolutionary algorithms, or more generally randomized search heuristics, have
widely and successfully been applied to complex engineering problems and
problems from combinatorial optimization. In the lecture we introduce different randomized search heuristics that use concepts from nature. Besided evolutionary algorithms, these include simulated annealing or the metropolis algorithm. We analyze these algorithms from a theoretical point of view. Such analyses help to understand how these heuristics work as well as to design better such algorithms for new problems. This is a particularly interesting area since still most of the existing, very promising experimental results in this field need a theoretical justification/explanation. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Audience: |
The course is a 2 hours computer science lecture. It is a
"Spezialvorlesung". Together with the exercises (also 2 hours),
it yields 6LP (provided you pass the exam). The course needs no
particular prerequisites except basics in algorithmics and
mathematics. The lecture will be given in English. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Exercises: |
The exercise course takes place Thursday, 9:30, in Room 023 (starts
October 26). You may form teams of two. Each exercise sheet has
four problems. Fully solving a problem earns you four point. Not
even trying to solve a problem earns you one point. To be admitted
to the final exam, you need 62,5% of the points (in average 10 per
sheet equivalent to fully solving two problems). Exercise sheets
will be posted below on Wednesday. They are due in the lecture the
following Tuesday and will be returned and discussed on Thursday in
the exercise course. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Exercise sheets: |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Forum: |
A discussion forum on anything related to the course can be found here. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Lecture details: |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Literature: |
We suggest the following literature:
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||