Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
ISY 528HEURISTIC METHODS3 + 02nd Semester6

COURSE DESCRIPTION
Course Level Master's Degree
Course Type Elective
Course Objective The aim of this course is to examine heuristic methods used to solve combinatorial optimization problems in which the problem size is too big or separating to sub-problems is difficult and give near optimal solutions in a shorter time. 
Course Content In this course, the basic features of heuristic and meta-heuristic algorithms will be discussed and the constructive algorithms, local search algorithms, genetic algorithms, tabu search, simulated annealing, variable neighborhood search, ant colony optimization etc. will be examined.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1At the end of this course, students will learn basic concepts in the field of heuristic and meta-heuristic methods and will have the ability to apply these methods to real life problems.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05
LO 00155555
Sub Total55555
Contribution55555

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)13565
Hours for off-the-classroom study (Pre-study, practice)13226
Mid-terms13452
Final examination11313
Total Work Load

ECTS Credit of the Course






156

6
COURSE DETAILS
 Select Year   


This course is not available in selected semester.


Print

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes