Learning Outcomes:
1. Identifying different optimization problems and disclosing their common ground
2. Recognizing the trade-offs between exact and heuristic approaches, and their distinct advantages and disadvantages
3. Distinguishing common attributes of efficient heuristic algorithms
4. Analysing several well-known metaheuristic algorithms
5. Modelling heuristic algorithms in a generic framework and design fair experimental procedures to evaluate their performance
6. Developing and applying a new heuristic algorithm to solve a real-world problem
Indicative Module Content:
1 18.05.2026 Introduction: Classic optimization problems, their classification, example applications
2 19.05.2026 Exact vs heuristic algorithms: Trade-offs
3 25.05.2026 History of heuristics
4 26.05.2026 Fundamental concepts in heuristics
5 02.06.2026 Single solution-based metaheuristics 1
6 15.06.2026 Single solution-based metaheuristics 2
7 16.06.2026 Computational experiments with heuristics
8 22.06.2026 Population-based metaheuristics
9 23.06.2026 Other types of heuristic algorithms
10 30.06.2026 Using AI to develop heuristics