This picture is adapted from "http://resources.arcgis.com/en/home/", Three food delivery trucks at a distribution center are assigned grocery stores and routes to the stores that minimize transportation costs. Vehicle capacities, lunch breaks, and maximum travel time constraints are included in the analysis.
■ Course description
This course focuses on the vehicle routing problem and its extensions. These problems are parts of the logistics network. In this course students will learn about shortest path, traveling salesman and vehicle routing problems with their classical solution methods.
■ Instructor
Assistant. Prof. Mostafa Setak
http://wp.kntu.ac.ir/setak
Email: setak[at]kntu.ac.ir
■ Assistant
PhD candidate: Saeed Alaei
http://wp.kntu.ac.ir/setak/salaei.htm
Email: alaei.saeed[at]gmail.com
■ Text books
Ghiani, G., Laporte, G., & Musmanno, R. (2004). Introduction to logistics systems planning and control. John Wiley & Sons.
Toth, P., & Vigo, D. (Eds.). (2001). The vehicle routing problem. Siam.
■ Grading
Exercises: %10
Presentation: %20
Final: %60
Final report: %10 (+ %10)
■ Documents
Introduction to course and graph theory
Shortest path problem
Double sweep algorithm for K-shortest path problem
Double sweep: MATLAB Code (Parsa Manesh)
Clarck and Wright algorithm (Sovizi)
Set covering for vehicle routing problem
Heuristic methods for solving TSP and VRP
Vehicle routing problem with time window (Zareie)
