|
Week - 1 |
Introduction and Review of Concepts and definitions of logistics, history of logistics and logistics management.
|
|
Week - 2 |
Logistics Management and Supply Chain Management, The relationship between Logistics Management and Supply Chain Management, the applications of strategical, tactical and operational logistics applications. |
|
Week - 3 |
Distribution Logistics Planning, the logistics network design and model the mathematical formulation, distribution logistics network design and modelling the mathematical formulations, many-to-many logistics systems, one-to-many logistics systems, milk-run logistics systems. |
|
Week - 4 |
Facility Location Problems: Uncapacitated and Capacitated Facility Location problems, Uncapacitated Facility Location problem and alternative formulations, Capacitated Facility Location problem and alternative formulations |
|
Week - 5 |
Classifying the problems as minisum, covering and center type by considering the objective functions of the problems; the p-median problem and 3&4-index mathematical models, the set covering and p-maximal covering problem and the mathematical models, the p-center problem and the mathematical models.
|
|
Week - 6 |
Hub location problems: Fixed costs hub location and p-hub median problems, the fixed costs hub location problem and the mathematical models, the p-hub median problem and alternative mathematical models. (2 index, 3 index and 4 index mathematical models).
|
|
Week - 7 |
Hub location problems: hub covering and p-hub center problems, mathematical models with 3&4 index alternative formulations
|
|
Week - 8 |
Travelling Salesman Problem and Sub-tour breaking constraints, Sub-tour breaking constraints and modelling of it in different ways by using the formulations from the literature |
|
Week - 9 |
Solution Techniques for Travelling Salesman Problems, Applications the nearest neighborhood, nearest insertion and savings algorithm to the Travelling Salesman Problem |
|
Week - 10 |
Multiple Travelling Salesman Problems; Variants and Models |
|
Week - 11 |
Hill-Climbing Algorithm for Multiple Travelling Salesman Problem
|
|
Week - 12 |
Vehicle Routing Problems, Variants and Models |
|
Week - 13 |
Classical Vehicle Routing Algorithms; Application of the nearest neighborhood, nearest insertion, savings, sweep and clustering algorithms to the Vehicle Routing Problem
|
|
Week - 14 |
Presentations of term projects |
Eskisehir Technical University Info Package 
Turkish 
English