|Website:||website containing additional information|
|Period:||periode 2 (week 46 t/m 5, dwz 9-11-2009 t/m 5-2-2010; herkansing week 11)
|Participants:||up till now 30 subscriptions|
|Schedule:||Note: from now on the schedule is to be found in Osiris|
|Teachers:||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 representations and variation operators for specific problems. We also 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 + report of the practical assignment. Both count for 50% of the final grade. During the exam 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:||Passed the practical assignment.|