ΔΕΑL0202 TRANSPORTATION-LOGISTICS NETWORK ALGORITHMS (Core Elective)

ΔΕΑL0202 TRANSPORTATION-LOGISTICS NETWORK ALGORITHMS (Core Elective)

Course Information

Course Outline

Course Category
Course Type
Course Code
Semester
Contact Hours
ECTS Units
Division
Instructor

Graduate
Core Elective
ΔΕΑL0202
2nd (Spring)
3 hours/week
7.5
Production Management & Industrial Administration
Athanassios (Thanasis) Ziliaskopoulos – Athanassios (Thanasis) Lois

Course Category: Graduate
Course Type: Core Elective
Course Code: ΔΕΑL0202
Semester: 2nd (Spring)
Contact Hours: 3 hours/week
ECTS Units: 7.5
Division: Production Management and Industrial Administration
Instructor: Athanassios (Thanasis) Ziliaskopoulos – Athanassios (Thanasis) Lois

Scope
Familiarization with basic concepts and algorithms for network optimization (such as minimum spanning tree, shortest path, VRP, TSP) with application to logistics systems.
Contents
  • Introduction to Modeling, Graphs, BFS/DFS Algorithms.
  • Minimum Spanning Tree (MST) and Shortest Path Problems.
  • Transportation Model, Maximum flow / Minimum cut.
  • Routing problems (Euler, CPP, TSP, VRP) and solution algorithms.
  • Location Problems (Median, Center, Set Covering).
Bibliography
  • Simchi-Levi, D., Kaminsky, P., & Simchi-Levi, E. (2008). The logic of logistics: Theory, practice, and integrated control (3rd ed.). Springer.
  • Larson, R. C., & Odoni, A. R. (1981). Urban operations research. Prentice-Hall.
  • Taha, H. A. (2017). Operations research: An introduction (10th ed.). Pearson.
Educational Material
Slides, software, algorithm coding, website.
Language of Instruction

Greek or English.

Teaching Method

Lectures and Assignments.

Assessment
  • Final Examination (75%). 
  • Written Assignments (15%). 
  • Attendance / Participation (10%).
Workload (in hours)

190.