
| Course Code | : MCS539 |
| Course Type | : Area Elective |
| Couse Group | : Second Cycle (Master's Degree) |
| Education Language | : English |
| Work Placement | : N/A |
| Theory | : 3 |
| Prt. | : 0 |
| Credit | : 3 |
| Lab | : 0 |
| ECTS | : 6 |
The aim of this course is to teach meta-heuristic methods and evolutionary computation techniques for complex and analytically difficult optimization problems, both theoretically and practically. Students are expected to understand the working principles of nature-inspired algorithms, design suitable solution methods for single and multi-objective optimization problems, and effectively apply these algorithms to real-world problems. The course also aims to develop students' ability to review current scientific literature in the field, critically read and analyze academic articles, and integrate the information they obtain into their own work. Furthermore, it aims to equip students with the competence to generate innovative solutions to engineering problems by understanding the role of meta-heuristic methods in current and applied artificial intelligence processes such as hyperparameter optimization, feature selection, and surrogate modeling.
This course provides a comprehensive introduction to the fundamental structures, variational operators, and optimization processes of genetic algorithms, differential evolution, swarm intelligence-based methods (PSO, ACO, ABC, etc.), and other nature-inspired meta-heuristic algorithms. Evolutionary multi-objective algorithms such as NSGA-II and SPEA2 are discussed in detail for single-objective and multi-objective optimization problems. Furthermore, hyperparameter optimization, feature selection, model improvement strategies, and surrogate modeling approaches are covered within the framework of using meta-heuristic methods in machine learning processes. The course develops students' skills in searching, reading, understanding, and critically evaluating current scientific articles in the field; it also emphasizes the comparative analysis and interpretation of methods presented in the literature. By supporting theoretical explanations with practical applications, example problem-solving, and literature review studies, the course aims to enable students to both develop meta-heuristic solutions suitable for real-world optimization problems and to actively participate in academic research processes.
| 1. | The student can explain the fundamental principles of metaheuristic and evolutionary algorithms and evaluate which types of problems these algorithms are suitable for. |
| 2. | The student can review current scientific literature in the field, understand, analyze, and interpret academic studies written on metaheuristic and evolutionary algorithms by comparing different methods. |
| 3. | The student can formulate single-objective and multi-objective optimization problems, select appropriate evolutionary and metaheuristic solutions, implement them, and interpret the results. |
| 4. | The student can develop performance-enhancing strategies in modern artificial intelligence processes using hyperparameter optimization with metaheuristic methods. |
| 5. | The student can develop performance-enhancing strategies in modern artificial intelligence processes using feature selection with metaheuristic methods. |
| 1. | Nature-Inspired Algorithms and Applied Optimization , Xin-She Yang |
| 2. | Metaheuristic Optimization: Nature-Inspired Algorithms, Swarm and Computational Intelligence Modestus O. Okwu & Lagouge K. Tartibu |
| Type of Assessment | Count | Percent |
|---|---|---|
| Presentation | 1 | %5 |
| Report | 1 | %10 |
| Project | 1 | %15 |
| Final Examination | 1 | %70 |
| Activities | Count | Preparation | Time | Total Work Load (hours) |
|---|---|---|---|---|
| Lecture - Theory | 14 | 3 | 3 | 84 |
| Project | 1 | 22 | 3 | 25 |
| Presentation | 1 | 9 | 1 | 10 |
| Report | 1 | 9 | 1 | 10 |
| Final Examination | 1 | 20 | 1 | 21 |
| TOTAL WORKLOAD (hours) | 150 | |||
PÇ-1 | PÇ-2 | PÇ-3 | PÇ-4 | PÇ-5 | PÇ-6 | PÇ-7 | PÇ-8 | PÇ-9 | |
OÇ-1 | 5 | ||||||||
OÇ-2 | 5 | 5 | |||||||
OÇ-3 | 5 | 5 | 5 | ||||||
OÇ-4 | 5 | 5 | |||||||
OÇ-5 | 5 | 5 | |||||||