| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Network Models | MEN511 | Elective | Master's degree | 1 | Fall | 8 |
Name of Lecturer(s)
Prof. Dr. Alpaslan FIĞLALI
Assistant Prof. Dr. Celal ÖZKALE
Learning Outcomes of the Course Unit
1) Define basic concepts of network models
2) Define network descriptor matrices and explain their relationships
3) Use the models and solution methods of flow networks
4) Use the models and solution methods of distance networks.
5) Use the models and solution methods of project networks.
6) Distinguish the P and NP problem classes and explain exact, heuistic and metaheuristic method distinction
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||
| 1 | 2 | 3 | 4 | 5 | ||
| Learning Outcomes | ||||||
| 1 | High | Low | Low | Low | Low | |
| 2 | Middle | Middle | Low | Low | Low | |
| 3 | High | High | High | Low | Low | |
| 4 | High | High | Middle | Low | Low | |
| 5 | High | High | Low | Low | Low | |
| 6 | Middle | Middle | Low | Low | Low | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Metaheuristic Optimization Optimization Applications in Industrial Engineering
Course Contents
This course equips cadidates with in-depth knowledge on basic concepts of graph and networks, historical development, matrix representation of graphs and relations between the matrixes, combinatorial optimisation, heuristic methods, graph partitioning, graph coloring, planarity of graphs and Euler formula, flow networks, maximum flow problem, min cost flow problem, distance networks, minimum spanning tree problem, shortest path problem, traveling salesman problem, vehicle routing problem and layout planning problem.
Weekly Schedule
1) Basic Concepts of Graphs and Networks, Chronogical Review2) Matrix Representations of Networks and Relations between Matrices
3) Combinatorial Optimization, Heuristic Methods
4) Network Split and Coloring
5) Planarity in Graphs and Euler Formula
6) Flow Networks: Problem of Maximum Flow
7) Flow Networks: Problem of Minimum Cost Flow
8) Midterm Examination/Assessment
9) Distance Networks: Minimum Spanning Tree Problem
10) Distance Networks: Shortest Path Problem
11) Distance Networks: Travelling Salesman Problem
12) Distance Networks: Course Problem
13) Distance Networks: Facility Layout Problem
14) Project Networks
15) Discussion and Computer Applications
16) Final Examination
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
1) Modelling
2) Modelling
3) Modelling
4) Simulation
5) Simulation
6) Simulation
Assessment Methods and Criteria
Contribution of Semester Studies to Course Grade |
60% |
||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|||||||||||||||
Contribution of Final Examination to Course Grade |
40% |
||||||||||||||
Total | 100% | ||||||||||||||
Language of Instruction
Turkish
Work Placement(s)
Not Required