>
Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
---|---|---|---|---|---|---|
Heuristic Optimization Techniques | BTM517 | Elective | Master's degree | 1 | Fall | 8 |
Prof. Dr. Mehmet YILDIRIM
Research Assistant Seda BALTA
Research Assistant Gizem YILDIZ
1) Explain the basic concepts in heuristic optimization
2) Classify the optimization problems and solution techniques
3) Compare the heuristic search and optimization algorithms
4) Implement the heuristic algorithms in optimization problems
5) Solve the constrained optimization problems
Program Competencies | ||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | ||
Learning Outcomes | ||||||||
1 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
2 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
3 | No relation | No relation | No relation | High | No relation | No relation | No relation | |
4 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
5 | No relation | No relation | No relation | No relation | No relation | No relation | No relation |
Face to Face
None
Matlab, Phyton, C++
Basic concepts in heuristic optimizations: description of problem, representation, cost function, local and global optima, neighborhood, hill climbing. Classification of optimization problems and their solution techniques. Consideration of constraints. Heuristic search and optimization algorithms: constructive search, local search, simulated annealing, tabu search, genetic algorithms, ant colony optimization, artificial neural network and hybrid algorithms.
Turkish
Not Required