Evolutionary Computing

Lecturer:

Jiří Lažanský (gar.)

Tutor:

Jiří Lažanský (gar.)

Supervisor:

Department of Cybernetics

Synopsis:

Introduction to evolutionary computing in contrast to classical computing

techniques, Genetic algorithms (GA) for optimisation. The Simple Genetic

Algorithm (SGA) and its behaviour. GA Convergence, negative phenomena. GA

and constrained tasks, special representations. Genetic Programming (GP),

relationship to GA. GP typical tasks, GP and machine learning. GA and GP

applications. Special methods for improving GA performance.

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

Michalewicz, Zbigniew: Genetic Algorithms + Data Structures = Evolution

Programs, Springer-Verlag, 1992

Note:

Time-table for winter semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Fri
Thu	roomKN:E-218 Lažanský J. 15:15–17:00 (lecture parallel1) Karlovo nám. Cvičebna
Fri

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Doctoral studies, daily studies (compulsory elective course)
• Doctoral studies, combined studies (compulsory elective course)
• Doctoral studies, structured daily studies (compulsory elective course)
• Doctoral studies, structured combined studies (compulsory elective course)