Distance matrix
i/j 0 1 2 3 4 5 6 7
0 0 19 18 15 36 4 12 21
1 19 0 37 10 53 21 31 40
2 18 37 0 33 18 22 6 15
3 15 10 33 0 50 11 27 36
4 36 53 18 50 0 40 24 9
5 4 21 22 11 40 0 16 25
6 12 31 6 27 24 16 0 9
7 21 40 15 36 9 25 9 0
Capacity 820
Savings Sequential
i j c_i0 c_0j c_ij s_ij not in S Route 1 Route 2
4 7 36 21 9 48 1
2 4 18 36 18 36 1
1 3 19 15 10 24
2 6 18 12 6 24
2 7 18 21 15 24
4 6 36 12 24 24
6 7 12 21 9 24
3 5 15 4 11 8 1
1 4 19 36 53 2
1 5 19 4 21 2
3 4 15 36 50 1
1 2 19 18 37 0
1 6 19 12 31 0 1
1 7 19 21 40 0
2 3 18 15 33 0 1
2 5 18 4 22 0
3 6 15 12 27 0
3 7 15 21 36 0
4 5 36 4 40 0
5 6 4 12 16 0
5 7 4 21 25 0
Savings 92 0
Route(0, 5, 3, 2, 4, 7,0) (0, 1, 6,0)
Distance using a route to each customer 250
Total savings 92
Total distance 158
Demand
Quantity Route Route 2 Route 3
286 1
341 1
126 1
93 1
24 1
415 1 Therefore, solo loop, saving = 0
196 1
Load 630 436 415
equential Parallel
Seq added Route 1 Route Seq added
1 1 1
2 1 2
1 3
4 1 5 We find out that 6 must be on it's own loop
because it does not fit in either of the excisting
routes and 2 is already on route 1
84 32
(0,7,4,2,0) (0,1,3,5,0) (0,6,0)
250 Remeber to check for solo loops (savings =0)
116
134
on it's own loop
ther of the excisting
oute 1
