Public View

You are viewing the public version of the syllabus. If you have a SUNet account, you can view the richer version of the syllabus after logging in.

IE 58006
Special Topics in Industrial Engineering: Heuristic Optimization

Faculty Faculty of Engineering and Natural Sciences
Semester Fall 2026-2027
Course IE 58006 - Special Topics in Industrial Engineering: Heuristic Optimization
Time/Place
Time
Week Day
Place
Date
09:40-10:30
Mon
FENS-L048
Sep 28-Dec 31, 2026
12:40-14:30
Tue
FENS-L058
Sep 28-Dec 31, 2026
Level of course Masters
Course Credits SU Credit:3, ECTS:10
Prerequisites -
Corequisites -
Course Type Lecture

Instructor(s) Information

İhsan Sadati

Course Information

Catalog Course Description
This course introduces heuristic and metaheuristic optimization methods for solving complex optimization problems that are difficult to solve exactly within reasonable computational time. The course covers constructive heuristics, local search, neighborhood design, improvement heuristics, and major metaheuristic frameworks such as simulated annealing, tabu search, genetic algorithms, variable neighborhood search, and ant colony optimization. Emphasis is placed on algorithm design principles, intensification and diversification mechanisms, parameter tuning, and computational evaluation. Students will gain both theoretical understanding and practical experience through implementation and testing on representative industrial engineering problems such as routing, scheduling, assignment, and network design.
Learning Outcomes:
1. Explain the role of heuristic and metaheuristic optimization methods in solving complex combinatorial optimization problems.
2. Design, implement, and analyze constructive heuristics, local search methods, and improvement procedures.
3. Develop and apply major metaheuristics such as simulated annealing, tabu search, genetic algorithms, variable neighborhood search, and ant colony optimization.
4. Evaluate heuristic algorithms through computational experiments using appropriate performance metrics, benchmarking, and sensitivity analysis.
5. Compare exact and heuristic approaches in terms of solution quality, computational effort, scalability, and practical applicability.
6. Develop complete heuristic solution approaches for practical optimization problems, including parameter tuning and computational performance analysis.
Course Objective
The objective of this course is to introduce students to the principles, methods, and applications of heuristic optimization through a range of combinatorial optimization problems relevant to modern Industrial Engineering. Upon completing this course, students will be able to:
- Explain the role of heuristic and metaheuristic optimization methods in solving complex combinatorial optimization problems,
- Design, implement, and analyze constructive heuristics, local search methods, and improvement procedures,
- Develop and apply major metaheuristics such as simulated annealing, tabu search, genetic algorithms, variable neighborhood search, and ant colony optimization.
- Evaluate heuristic algorithms through computational experiments using appropriate performance metrics, benchmarking, and sensitivity analysis,
- Compare exact and heuristic approaches in terms of solution quality, computational effort, scalability, and practical applicability,
- Develop complete heuristic solution approaches for practical optimization problems, including parameter tuning and computational performance analysis.
-

Course Materials

Resources:
Textbook
• Éric D. Taillard, Design of Heuristic Algorithms for Hard Optimization. Graduate Texts in Operations Research. Springer, 2022.

Recommended Reading
•Talbi, E.-G., Metaheuristics: From Design to Implementation. Wiley, 2009.
•Gendreau, M. and Potvin, J.-Y. (eds.). Handbook of Metaheuristics. 3rd ed. Springer, 2019.
Technology Requirements:

Policies