Department of Industrial Engineering

IE 359 | Course Introduction and Application Information

Course Name

Network Optimization

Code	Semester	Theory (hour/week)	Application/Lab (hour/week)	Local Credits	ECTS
IE 359	SPRING	3	0	3	6

Prerequisites	IE 252 To succeed (To get a grade of at least DD)
Course Language	English
Course Type	ELECTIVE_COURSE
Course Level	First Cycle
Mode of Delivery	Face to face
Teaching Methods and Techniques of the Course	Lecture / Presentation Problem solving
National Occupational Classification Code	-
Course Coordinator	Prof. Dr. Selin Özpeynirci
Course Lecturer(s)	Prof. Dr. Selin Özpeynirci
Assistant(s)	-

Course Objectives

Network flow problems form a subclass of linear programming problems with applications to transportation, logistics, manufacturing, computer science, project management, finance as well as a number of other domains. The aim of this course is to introduce the basic network problems and solution methods to the students.

Learning Outcomes

The students who succeeded in this course;

Name	Description	PC Sub	* Contribution Level
Name	Description	PC Sub	1	2	3	4	5
LO1	Will be able to formulate a wide variety of industrial engineering applications as network flow problems			X
LO2	Will be able to use various techniques to solve shortest path problems			X
LO3	Will be able to use various techniques to solve maximum flow problems				X
LO4	Will be able to use various techniques to solve minimum cost flow problems				X
LO5	Will be able to use various techniques to solve minimum spanning tree and assignment problems				X
LO6	Will be able to identify and solve distribution and routing problems			X

Course Description

Topics of this course include the shortest path problem, the maximum flow problem, the minimum cost flow problem, the multicommodity flow problem and other extensions of network flow problems.

Related Sustainable Development Goals

Course Category	Core Courses
	Major Area Courses	X
	Supportive Courses
	Media and Managment Skills Courses
	Transferable Skill Courses

WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES

Week	Subjects	Required Materials	Learning Outcome
1	Introduction, Notation and definitions	Lecture notes	LO1
2	Shortest path problem	Lecture notes	LO2
3	Shortest path problem	Lecture notes	LO2
4	Maximum flow problem	Lecture notes	LO3
5	Maximum flow problem	Lecture notes	LO3
6	Minimum cost flow problem	Lecture notes	LO4
7	Minimum cost flow problem	Lecture notes	LO4
8	Midterm exam		-
9	Minimum spanning trees, Assignments and matchings	Lecture notes	LO5
10	Transportation problem	Lecture notes	LO6
11	Travelling salesperson problem	Lecture notes	LO6
12	Chinese postman problem	Lecture notes	LO6
13	Vehicle routing problem	Lecture notes	LO6
14	Project Presentations		LO1
15	Review		-
16	Final exam		-

Course Notes/Textbooks	-
Suggested Readings/Materials	Lecture notes Ravindra K. Ahuja Thomas L. Magnanti James B. Orlin Network Flows: Theory Algorithms and Applications Prentice Hall. && Wayne L. Winston Operations Research. Applications and Algorithms Duxbury Press Belmont California 1994.

EVALUATION SYSTEM

Semester Activities	Number	Weighting	LO1	LO2	LO3	LO4	LO5	LO6
Quizzes / Studio Critiques	4	20		X	X	X	X	X
Project	1	15	X
Midterm	1	30	X	X	X	X
Final Exam	1	35					X	X
Total	7	100

ECTS / WORKLOAD TABLE

Semester Activities	Number	Duration (Hours)	Workload
Participation	-	-	-
Theoretical Course Hours	16	3	48
Laboratory / Application Hours	-	-	-
Study Hours Out of Class	14	4	56
Field Work	-	-	-
Quizzes / Studio Critiques	4	4	16
Portfolio	-	-	-
Homework / Assignments	-	-	-
Presentation / Jury	-	-	-
Project	1	20	20
Seminar / Workshop	-	-	-
Oral Exams	-	-	-
Midterms	1	17	17
Final Exam	1	23	23
		Total	180