Saving Matrik

Clustering: Saving matrix method

Savings of consolidating two customers X and Y:

Eliminating going from X to DC and Eliminating going from DC to Y But adding going from X to Y

S(X,Y)=Dist(DC,X)+Dist(DC,Y)-Dist(X,Y) S(X,Y) < 0 , when is this possible if ever?

X
DC

Clustering Example
Warehouse Customer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 6 Customer 7 Customer 8 Customer 9 Customer 10 Customer 11 Customer 12 Customer 13 X-Coordinate 0 0 6 7 9 15 20 17 7 1 15 20 7 2 Y-Coordinate 0 12 5 15 12 3 0 -2 -4 -6 -6 -7 -9 -15 Demand 48 36 43 92 57 16 56 30 57 47 91 55 36

Clustering: Distance Matrix

Whse Whse Cust 1 Cust 2 Cust 3 Cust 4 Cust 5 Cust 6 Cust 7 Cust 8 Cust 9 Cust 10 Cust 11 Cust 12 Cust 13 0 12 8 17 15 15 20 17 8 6 16 21 11 18 Cust 1 0 9 8 9 17 23 22 17 18 23 28 22 28 Cust 2 Cust 3 Cust 4 Cust 5 Cust 6 Cust 7 Cust 8 Cust 9 Cust 10 Cust 11 Cust 12 Cust 13

0 10 8 9 15 13 9 12 14 18 14 19

0 4 14 20 20 19 22 22 26 24 28

0 11 16 16 16 20 19 22 21 25

0 6 5 11 17 9 11 14 15

0 4 14 20 8 7 16 13

0 10 16 4 6 12 10

0 6 8 13 5 11

0 14 19 7 14

0 5 9 6

0 13 8

0 8

S(6,11)=Dist(W,6)+Dist(W,11)-Dist(6,11)=20+21-7=34

Penghitungan Matriks Penghematan

Matriks penghematan menampilkan penghematan yang diperolah dengan menggabungkan dua konsumen dalam satu perjalanan. Penghematan dapat dihitung dalam skala uang, waktu, maupun jarak. Perjalanan A diidentifikasikan dalam urutan lokasi yang dikunjungi oleh media transportasi. Perjalanan DC > Cust x > DC dijabarkan dalam perjalanan yang dimulai dari DC, kemudian mengunjungi pelanggan x, dan kembali lagi ke DC. Penghematan S(x,y) adalah jarak yang dihemat jika perjalanan DC>Cust x > DC dan perjalanan DC > Cust y > DC digabungkan dalam satu urutan perjalanan DC> Cust x > Cust y > DC.

Hitung Saving matrik

Whse Whse Cust 1 Cust 2 Cust 3 Cust 4 Cust 5 Cust 6 Cust 7 Cust 8 Cust 9 Cust 10 Cust 11 Cust 12 Cust 13 0 12 8 17 15 15 20 17 8 6 16 21 11 18 Cust 1 0 9 8 9 17 23 22 17 18 23 28 22 28 Cust 2 Cust 3 Cust 4 Cust 5 Cust 6 Cust 7 Cust 8 Cust 9 Cust 10 Cust 11 Cust 12 Cust 13 0 10 8 9 15 13 9 12 14 18 14 19 0 4 14 20 20 19 22 22 26 24 28

0 11 16 16 16 20 19 22 21 25

0 6 5 11 17 9 11 14 15

0 4 14 20 8 7 16 13

0 10 16 4 6 12 10

0 6 8 13 5 11

0 14 19 7 14

0 5 9 6

0 13 8

0 8

Truck Cust 1 demand 48 Cust 1 Cust 2 Cust 3 Cust 4 Cust 5 Cust 6 Cust 7 1 2 3 4 5 6 7 0 11

Cust 2 36

Cust 3 43

Cust 4 92

Cust 5 57

Cust 6 16

Cust 7 56

Cust 8 30

Cust 9 Cust 10 Cust 11 Cust 12 Cust 13 57 47 91 55 36

21
18 10 9 7

0 15 15 14 13 12

28
18 17 14

0 19 19 16 0 29 27 0

33
14 6 28

Cust 8 Cust 9 Cust 10 Cust 11 Cust 12 Cust 13

8 9 10 11 12 13

3 0 5 5 1 2

7 2 10 11 5 7

6 1 11 12 4 7

7 1 12 14 8 8

12 4 22 25 12 18

34
15 25

15 7 29 32 16 25

0 8 16 16 14 15

0 8 8

0 32

10 10

18 28

19 31

0 21

Clustering(penggabungan customer dalam rute) - kapasitas truk 200

Truck Cust 1 demand 48 Cust 1 1 0 Cust 2 2 11 Cust 3 3 21
Cust 4 Cust 5 Cust 6 Cust 7 Cust 8 Cust 9 Cust 10 Cust 11 Cust 12 Cust 13 4 5 6 7 8 9 10 11 12 13 18 10 9 7 3 0 5 5 1 2

Cust 2 36
0 15 15 14 13 12 7 2 10 11 5 7

Cust 3 43

Cust 4 92

Cust 5 57

Cust 6 16

Cust 7 56

Cust 8 30

Cust 9 Cust 10 Cust 11 Cust 12 Cust 13 57 47 91 55 36

28
18 17 14 6 1 11 12 4 7

0 19 19 16 7 1 12 14 8 8 0 29 27 12 4 22 25 12 18 0

33
14 6 28

0 15 7 29 32 16 25 0 8 16 16 14 15

34
15 25

0 8 8
10 10

0 32 18 28

0 19 31 0 21 0

Largest saving 34, combine 6 and 11: consumed capacity 107. Largest saving 33, combine 7: consumed capacity 163. Largest saving 32, combine 7: Not possible. Already in the route. Largest saving 32, combine 10: Not possible. Lack of capacity.

Clustering with savings matrix

Attempt to combine different routes with the highest available saving If load is over capacity, reject the combination Else accept the combination and make savings unavailable

Truck routes: {1,3,4}, {2,9}, {6,7,8,11} (=fills truck by 193/200) and {5,10,12,13}

Cost Matrix(Distance Matrix)

The Saving Matrix

Kapasitas angkut 200