Course detail
Evolution Algorithms
FEKT-NEALAcad. year: 2016/2017
The course is focused on deterministic and stochastic optimization methods for finding global minima. It focuses on evolutionary algorithms with populations such as genetic algorithms, controlled random search, evolutionary strategies, particle swarm method, the method of ant colonies and more.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Offered to foreign students
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
2. Method of steepest descent, Newton's method
3. Stochastic algorithms for finding global minima, the simplex method
4. Evolutionary algorithms with populations. Binary genetic algorithms.
5. Continuous genetic algorithms.
6. Controlled random search, evolutionary strategies, particle swarm
7. Differential evolution, SOMA, ant colony
8. Swarm algothms: BAT, FA, GSO.
9. Swarm algothms: GWO, BA, ABC.
10. Test function for checking optimization algorithms
11. Experimental comparison of evolutionary algorithms
12. Introduction to genetic programming
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
Classification of course in study plans