Graduated course 66-6-137-60: Vehicles Routing

 

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.

Announcements

15.06.2014: The deadline for final report is 25 June 2014.

25.05.2014: The exercises and presentation marks are added to the page.

27.04.2014: The exercise status section is updated.

14.04.2014: The exercise status section is updated.

09.03.2014: The exercise status section is added to this page.

08.03.2014: The exact solution of exercise02 is appended to its file.

08.03.2014: Please download the presentation sample file.

07.03.2014: The problem NO 3 in exercise 01 is changed.

06.03.2014: The due dates for exercises and presentations are updated.

05.03.2014: The web page for course is started.

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: Hossein Karimi

http://wp.kntu.ac.ir/hkarimi

Email: hkarimi[at]mail.kntu.ac.ir

■  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

Traveling salesman problem

Clarck and Wright algorithm (Saving algorithm)

Multiple traveling salesman problem

Vehicle routing problem

Set covering for vehicle routing problem

Heuristic methods for solving TSP and VRP

Genetic algorithm for TSP and VRP

Vehicle routing problem with time window

Periodic vehicle routing problem

Vehicle routing problem with backhaul

Vehicle routing problem with pickup and delivery

■  Exercises

Name

Due date

Notations

Exercise01

Tuesday, March 11, 2014

Exception: The due date for P.2. is Tuesday, April 8, 2014

Exercise02

Sunday, March 9, 2014

Exception: The due date for P.3. is Sunday, April 6, 2014

Exercise03 Sunday, April 20, 2014 -
     

■  Presentation papers

Name

Title

Due date Presentation

Ariafar, Tohid

A stochastic inventory routing problem for infectious medical waste collection Sunday, May 18, 2014

file

Asgarshahbazi, Mahsa

The Stochastic Vehicle Routing Problem for Minimum Unmet Demand Sunday, May 4, 2014

file

Dehghani, Maziar

New mixed integer-programming model for the pickup-and-delivery problem with transshipment Tuesday, May 6, 2014

file

Ghasemi, Afshin Open Vehicle Routing Problem with Demand Uncertainty and its Robust Strategies Tuesday, April 22, 2014

file

Ipakchi,  Seyed Farshid

Mixed integer and heuristics model for the inventory routing problem in fuel delivery Sunday, April 20, 2014

file

Momeni, Masoud

The bi-objective Pollution-Routing Problem Sunday, May 11, 2014

file

Moslehimehr, Mohammad

Many-to-many Location-Routing with Inter-Hub Transport and Multi-Commodity Pickup-and-Delivery Tuesday, May 20, 2014

file

Sadeghi, Mohsen

Selective multi-depot vehicle routing problem with pricing Sunday, April 27, 2014

file

Samadi, Maryam

 New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times Tuesday, April 29, 2014

file

■  Exercises status

Name

Exercise01

Nearest Neighborhood (30) Insertion (30) TSP Formulation (40) Delivered time Nearest Neighborhood code (100) Delivered time

Ariafar, Tohid

30 30 30 11.03.2014 100 13.04.2014

Asgarshahbazi, Mahsa

30 25 30 11.03.2014 100 06.04.2014

Dehghani, Maziar

30 30 30 11.03.2014 100 08.04.2014
Ghasemi, Afshin 30 25 30 11.03.2014 100 07.04.2014

Ipakchi,  Seyed Farshid

30 30 40 11.03.2014 100 05.04.2014

Momeni, Masoud

30 25 40 11.03.2014 100 08.04.2014

Moslehimehr, Mohammad

25 25 40 11.03.2014 100 08.04.2014

Sadeghi, Mohsen

30 30 40 11.03.2014 100 05.04.2014

Samadi, Maryam

30 25 40 11.03.2014 100 07.04.2014

 

Name Christofides method(100) Delivered time

Exercise02

C&W code (100) Delivered time C&W (45) 2opt(45) MTSP(10) Delivered time

Ariafar, Tohid

100 09.03.2014 80 19.04.2014 45 45 7 09.03.2014

Asgarshahbazi, Mahsa

100 04.03.2014 80 06.04.2014 45 45 10 09.03.2014

Dehghani, Maziar

100 11.03.2014 80 18.04.2014 45 40 7 09.03.2014
Ghasemi, Afshin 100 09.03.2014 90 06.04.2014 45 40 7 09.03.2014

Ipakchi,  Seyed Farshid

100 09.03.2014 80 05.04.2014 45 45 10 09.03.2014

Momeni, Masoud

100 09.03.2014 80 08.04.2014 45 45 7 09.03.2014

Moslehimehr, Mohammad

100 11.03.2014 80 07.04.2014 45 45 7 09.03.2014

Sadeghi, Mohsen

100 04.03.2014 80 04.04.2014 45 45 10 09.03.2014

Samadi, Maryam

100 04.03.2014 80 05.04.2014 45 45 10 09.03.2014

 

Name

Exercise03

MTSP(100) + Exact Solution(30) Delivered time

Ariafar, Tohid

- - -

Asgarshahbazi, Mahsa

100 30 20.04.2014

Dehghani, Maziar

100 0 20.04.2014
Ghasemi, Afshin 100 0 20.04.2014

Ipakchi,  Seyed Farshid

100 0 20.04.2014

Momeni, Masoud

100 0 20.04.2014

Moslehimehr, Mohammad

- - -

Sadeghi, Mohsen

100 0 20.04.2014

Samadi, Maryam

100 0 20.04.2014

■  Marks

Name

Exercise (2)

Presentation (4)

Ariafar, Tohid

1.25 3.8

Asgarshahbazi, Mahsa

2 3.8

Dehghani, Maziar

1.75 3.6
Ghasemi, Afshin 1.91 3.6

Ipakchi,  Seyed Farshid

1.95 3.7

Momeni, Masoud

1.91 3.6

Moslehimehr, Mohammad

1.25 0

Sadeghi, Mohsen

1.95 3.7

Samadi, Maryam

1.94 3.8