|Website:||website containing additional information|
|Period:||periode 2 (week 46 t/m 5, dwz 12-11-2007 t/m 1-2-2008; herkansing week 11)
|Participants:||up till now 41 subscriptions|
|Schedule:||Dit is een oud rooster!
|Contents:||Evolutionary algorithms (EAs) are population-based, stochastic search algorithms based on the mechanisms of natural evolution. We will study how to design solution representations and variation operators for specific problems, and analyse convergence behavior and population sizing. The course will focus on the combination of EAs with local search heuristics to solve combinatorial optimization problems like graph bipartitioning, graph coloring, and bin packing.|
|Literature:||Lecture slides + papers|
|Course form:||Lecture + practical assignment|
|Exam form:||Written exam (2x) + report of the practical assignment. Both count for 50% of the final grade. During the exams you can use a self-written single sheet of paper (A4 - double-sided) with notes of the course.
|Minimum effort to qualify for 2nd chance exam:||To qualify for the additional test you must have participated in one of the two exams and have submitted the report of the practical assignment.