Information Package / Course Catalogue
Metaheuristics and Evolutionary Computation
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
Objectives of the Course

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.

Course Content

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.

Name of Lecturer(s)
Learning Outcomes
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.
Recommended or Required Reading
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
Weekly Detailed Course Contents
Week 1 - Preparation Work
What is metaheuristics, why is it used; concepts of optimization and nature inspiration; course objectives.
Week 2 - Preparation Work
Genetics concept, population, fitness, selection, crossbreeding, mutation.
Week 3 - Preparation Work
Continuous & discrete representations; coding, elitism. Homework: Simple GA application.
Week 4 - Preparation Work
Introduction to different evolutionary paradigms; variance control, strategy parameters.
Week 5 - Preparation Work
Basic principles of Differential Evolution algorithm, parameter tuning, advantages.
Week 6 - Preparation Work
Swarm intelligence: Basic principles of Particle Swarm Optimization.
Week 7 - Preparation Work
Ant Colony Optimization (ACO), Bee Colony, Bird/Animal inspired algorithms.
Week 8 - Preparation Work
Bat algorithm, Firefly algorithm
Week 9 - Preparation Work
Multi-objective optimization problems: Algorithms such as Pareto optimality, NSGA-II, SPEA2.
Week 10 - Preparation Work
Hyperparameter Optimization
Week 11 - Preparation Work
Feature Selection
Week 12 - Preparation Work
Surrogate Modeling
Week 13 - Preparation Work
Projects and Presentations
Week 14 - Preparation Work
Projects and Presentations
Assessment Methods and Criteria
Type of AssessmentCountPercent
Presentation1%5
Report1%10
Project1%15
Final Examination1%70
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory143384
Project122325
Presentation 19110
Report19110
Final Examination120121
TOTAL WORKLOAD (hours)150
Contribution of Learning Outcomes to Programme Outcomes
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
Adnan Menderes University - Information Package / Course Catalogue
2026