| Course Type | Elective Course |
|---|
| Course Level | Master's Degree With Thesis |
|---|
| Year of Study | - |
|---|
| Semester | - |
|---|
| ECTS | 10 |
|---|
| Name of Lecturer(s) |
|
| Learning Outcomes |
At the end of this course, the students;
- Gain an ability to design and conduct experiments, as well as to analyze and interpret data
- Gain an ability to identify, formulate, and solve engineering problems
- Gain an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice.
|
| Mode of Delivery | Face to face |
|---|
| Prerequisites | No |
|---|
| Recommended Optional Programme Components | None |
|---|
| Course Description | The description and structure of production systems, heuristic search methods in production planning, branch-and-bound technique, local search, tabu search, simulated annealing, genetic algorithms, heuristic scheduling methods, neighborhood search, makespan minimizing techniques, weighted tardiness problems, bottleneck heuristics. |
|---|
| Course Contents |
| WEEK |
TOPICS |
|
1st Week |
Concepts of optimization, local optimum, global optimum |
|
2nd Week |
NP-hard problems and their complexity |
|
3rd Week |
Basic heuristic methods: random search, Hill Climbing algorithms |
|
4th Week |
The application of these algorithms on an example problem |
|
5th Week |
The General review of modern heuristic algorithms and applications |
|
6th Week |
Basic principles of evolutionary algorithms and application areas |
|
7th Week |
The application of evolutionary algorithms on an example problem |
|
8th Week |
Midterm |
|
9th Week |
Basic principles of genetic algorithms and application areas |
|
10th Week |
Basic principles of simulated annealing and application areas |
|
11th Week |
The application of simulated annealing algorithms on an example problem |
|
12th Week |
Basic principles of Tabu Search algorithms and application areas |
|
13th Week |
The application of Tabu Search algorithms on an example problem |
|
14th Week |
Project presentation |
|
| Recommended or Required Reading | Modern Heuristic Techniques for Combinatorial Problems Colin Reeves, John Wiley,1993 |
|---|
| Planned Learning Activities and Teaching Methods |
- Lecture
- Questions/Answers
- Problem Solving
- Practice
- Presentation
|
|---|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
1 |
30 |
| Project |
1 |
30 |
| Total(%) |
|
60 |
| Contribution of In-term Studies to Overall Grade(%) |
|
60 |
| Contribution of Final Examination to Overall Grade(%) |
|
40 |
| Total(%) |
|
100 |
|
| ECTS Allocated Based on Student Workload |
| Activities |
Quantity |
Duration (Hour) |
Total Workload (Hour) |
| Midterm exam |
1 |
2 |
2 |
| Preparation for Quiz |
|
|
|
| Individual or group work |
14 |
14 |
196 |
| Preparation for Final exam |
1 |
25 |
25 |
| Course hours |
14 |
3 |
42 |
| Preparation for Midterm exam |
1 |
25 |
25 |
| Laboratory (including preparation) |
|
|
|
| Final exam |
1 |
2 |
2 |
| Homework |
1 |
14 |
14 |
| Total Work Load | 306 |
| Total Work Load / 30 (h) | 10.2 |
| ECTS Credit of the Course | 10 |
|
| Language of Instruction | Turkish |
|---|
| Work Placement(s) | No |
|---|
