Information Package / Course Catalogue
Engineering Optimization With Metaheuristic Applications
Course Code: MCE505
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 objective of this course is to provide students with a solid understanding of optimization techniques and algorithms, enabling them to analyze, design, and implement effective optimization solutions for engineering applications. Students will develop critical thinking and problem-solving skills necessary to optimize engineering systems efficiently.

Course Content

This course covers the fundamentals of optimization, including mathematical foundations and Monte Carlo methods, various optimization algorithms such as Genetic Algorithms, Simulated Annealing, Ant Algorithms, Bee Algorithms, Particle Swarm Optimization, Harmony Search, and Firefly Algorithm. Additionally, the course includes multi-objective optimization techniques.

Name of Lecturer(s)
Learning Outcomes
1.Students will be able to demonstrate a solid understanding of optimization using metaheuristic techniques.
2.Students will be proficient in various metaheuristic optimization algorithms and be able to code these algorithm using programming languages.
3.Students will gain the ability to metaheuristic algorithms to solve real-world engineering problems effectively.
4.Students will develop problem-solving abilities, allowing them to analyze, design, and implement efficient optimization solutions in various engineering applications.
5.Students will be able to implement the models required by their field of expertise using programming languages, and to program algorithms to evaluate the obtained outputs using numerical and graphical methods.
Recommended or Required Reading
1.Engineering Optimization: An Introduction with Metaheuristic Applications (Yang, 2011)
2.Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks (Pham, Karaboğa, 2000)
Weekly Detailed Course Contents
Week 1 - Theoretical
Optimization Fundamentals
Week 2 - Theoretical
Mathematical Foundations
Week 3 - Theoretical
Monte Carlo Methods
Week 4 - Theoretical
Random Walk and Markov Chain
Week 5 - Theoretical
Genetic Algorithms
Week 6 - Theoretical
Simulated Annealing
Week 7 - Theoretical
Ant Algorithms
Week 8 - Theoretical
Bee Algorithms
Week 9 - Theoretical
Particle Swarm Optimization
Week 10 - Theoretical
Harmony Search
Week 11 - Theoretical
Firefly Algorithm
Week 12 - Theoretical
Multi-objective Optimization
Week 13 - Theoretical
Engineering Applications
Week 14 - Theoretical
Engineering Applications
Assessment Methods and Criteria
Type of AssessmentCountPercent
Presentation1%20
Assignment1%20
Quiz2%10
Final Examination1%50
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory141356
Assignment102424
Presentation 115015
Reading201020
Quiz2307
Final Examination125328
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
PÇ-10
PÇ-11
PÇ-12
PÇ-13
OÇ-1
3
4
4
5
3
4
4
4
5
3
3
3
5
OÇ-2
3
4
4
4
5
4
3
5
5
3
4
3
5
OÇ-3
5
5
5
5
4
5
4
5
5
4
5
5
3
OÇ-4
5
5
5
5
5
5
4
5
5
5
4
5
5
OÇ-5
4
5
5
5
5
5
4
5
5
5
3
4
4
Adnan Menderes University - Information Package / Course Catalogue
2026