|Website:||website containing additional information|
|Period:||period 3 (week 6 through 15, i.e., 6-2-2017 through 13-4-2017; retake week 27)
|Participants:||up till now 64 subscriptions|
|Schedule:||Official schedule representation can be found in Osiris|
|Teachers:||Dit is een oud rooster!
|week: 15||Mon 9-4-2018||8.30-11.30 uur||room: -|
|week: 27||Mon 2-7-2018||8.30-11.30 uur||room: -||retake exam|
|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. We will discuss how to combine EAs with local search heuristics to solve combinatorial optimization problems like graph bipartitioning, graph coloring, bin packing, … .|
|Literature:||Lecture slides + papers|
|Course form:||Lectures + practical assignment + seminar|
|Exam form:||Written exam (= 50% of final grade) + report of the practical assignment (= 35% of final grade) + seminar presentation (= 15% of 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:||To qualify for the resit exam your total grade should be at least 4 points.