Dynamic Vehicle Routing in MATSim (Michał Maciejewski)

CVRP
• CVRP = Capacitated Vehicle Routing Problem
• Input data
– 1 depot (node 0)
– n customers (nodes 1…n)
– k vehicles
– c ij travel cost for link i→j
– d i demand of node i
– C vehicle capacity
c 12 2 c 25
d 1 5 d 5 d 8
1
c 50 8
c 01 c 08
c 83
d 4
d 2
d 7
4
c 40
c 74 c 06 c 90 c 39
6
9
7 c 67 d 6
d 9
0
3
d 3
• Goal: minimal-cost routes
• Constraints:
– each route starts and ends at the depot
– each customer visited exactly once
– capacity of vehicles is never exceeded
R 1 = {1, 2, 5}
R 2 = {8, 3, 9}
R 3 = {6, 7, 4}
d 1 + d 2 + d 5 ≤ C
d 8 + d 3 + d 9 ≤ C
d 6 + d 7 + d 4 ≤ C
total cost = c 01 + c 12 + c 25 + c 50 +
+ c 08 + c 83 + c 39 + c 90 +
+ c 06 + c 67 + c 74 + c 40
4