Syllabus ( ICS 524 )
|
|
Basic information
|
|
| Course title: |
Heuristic Optimization Methods |
| Course code: |
ICS 524 |
| Lecturer: |
Prof. Dr. Fatih Erdoğan SEVİLGEN
|
| ECTS credits: |
7,5 |
| GTU credits: |
3 (3+0+0) |
| Year, Semester: |
1-2, Fall and Spring |
| Level of course: |
Second Cycle (Master's) |
| Type of course: |
Area Elective
|
| Language of instruction: |
Turkish
|
| Mode of delivery: |
Face to face
|
| Pre- and co-requisites: |
NONE |
| Professional practice: |
No |
| Purpose of the course: |
Teaching and application of heuristic methods to NP-complete or NP-hard problems whıch do not have efficient solutions. |
|
|
|
Learning outcomes
|
|
Upon successful completion of this course, students will be able to:
-
Apply metaheuristic methods to obtain efficient solutions for NP-complete or NP-hard problems
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Computer Engineering
-
Formulate and solve advanced engineering problems
Method of assessment
-
Term paper
-
List and define metaheuristic techniques
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Computer Engineering
Method of assessment
-
Written exam
-
Choose a suitable metaheurisitc technique for a given problem
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Computer Engineering
Method of assessment
-
Written exam
-
Homework assignment
|
|
|
Contents
|
|
| Week 1: |
What is Optimization? |
| Week 2: |
Greedy Solution Generation Methods |
| Week 3: |
Methods for Improving Solutions |
| Week 4: |
Branch and Bound |
| Week 5: |
Backtracking |
| Week 6: |
Genetic Algorithms |
| Week 7: |
Genetic Algorithms |
| Week 8: |
Simulated Annealing |
| Week 9: |
Midterm exam |
| Week 10: |
Particle Swarm Optimization |
| Week 11: |
Particle Swarm Optimization |
| Week 12: |
Tabu Search |
| Week 13: |
Tabu Search |
| Week 14: |
Variable Neighborhood Search |
| Week 15*: |
Iterated Local Search |
| Week 16*: |
Final exam |
| Textbooks and materials: |
Fred Glover, Gary Kochenberger, Handbook of Metaheuristics. |
| Recommended readings: |
Zbigniev Michalewicz, David Fogel, How to Solve It: Modern Heuristics. |
|
|
* Between 15th and 16th weeks is there a free week for students to prepare for final exam.
|
|
|
|
|
Assessment
|
|
|
| Method of assessment |
Week number |
Weight (%) |
|
| Mid-terms: |
9 |
30 |
| Other in-term studies: |
|
0 |
| Project: |
7,14 |
30 |
| Homework: |
|
0 |
| Quiz: |
|
0 |
| Final exam: |
16 |
40 |
| |
Total weight: |
(%) |
|
|
|
|
Workload
|
|
|
| Activity |
Duration (Hours per week) |
Total number of weeks |
Total hours in term |
|
| Courses (Face-to-face teaching): |
3 |
14 |
|
| Own studies outside class: |
4 |
14 |
|
| Practice, Recitation: |
0 |
0 |
|
| Homework: |
0 |
0 |
|
| Term project: |
10 |
4 |
|
| Term project presentation: |
3 |
2 |
|
| Quiz: |
0 |
0 |
|
| Own study for mid-term exam: |
12 |
1 |
|
| Mid-term: |
3 |
1 |
|
| Personal studies for final exam: |
20 |
1 |
|
| Final exam: |
3 |
1 |
|
| |
|
Total workload: |
|
| |
|
Total ECTS credits: |
* |
|
|
* ECTS credit is calculated by dividing total workload by 25.
(1 ECTS = 25 work hours)
|
|
|
-->
