|
Week - 1
|
Importance and types of vehicle routing |
|
Week - 2
|
Network representation and network features |
|
Week - 3
|
Transportation and assignment problems |
|
Week - 4
|
Shortest path problem and its solution approaches |
|
Week - 5
|
Traveling and multiple travelling salesmen problems |
|
Week - 6
|
Capacitated vehicle routing problem and sub types |
|
Week - 7
|
Pick up delivery and inventory routing problem |
|
Week - 8
|
Chinese postman and rural postmen problems |
|
Week - 9
|
Windy, directed and hierarchical postman problems |
|
Week - 10
|
Capacitated arc routing problem |
|
Week - 11
|
Nearest neighborhood, sweep and savings algorithms |
|
Week - 12
|
Minimum perfect matching and Ulusoy algorithms |
|
Week - 13
|
Vehicle routing with simulated annealing |
|
Week - 14
|
Vehicle routing with tabu search |