Nama : Aizzatul Ismiyah

NBI : 1412000205
Penelitian Operasi 2 (R)

Dynamic Programming

Hubungan pada setiap

Biaya
No Transportasi
pasang titik
($)
simpul / Node
1 (1,2) 4
2 (1,3) 8
3 (1,4) 6
4 (2,5) 14
5 (2,6) 8
6 (2,7) 12
7 (3,5) 6
8 (3,6) 4
9 (3,7) 8
10 (4,5) 8
11 (4,6) 2
12 (4,7) 10
13 (5,8) 2
14 (5,9) 4
15 (5,10) 6
16 (6,8) 8
17 (6,9) 4
18 (6,10) 6
19 (7,8) 5
20 (7,9) 5
21 (7,10) 5
22 (8,11) 2
23 (8,12) 8
24 (9,11) 12
25 (9,12) 6
26 (10,11) 6
27 (10,12) 6
28 (11,13) 6
29 (12,13) 8
Grafik Multitahap
Pemrosesan Tahap 5

X5 = N-13

Solusi Optimum
S s =N-11 dan N-12
f5(s) = cs,x5 X5
11 f5(11) = 6 13
12 f5(12) = 8 13
Pemrosesan Tahap 4

X4= N-11 dan N-12

 Pemrosesan Tahap 3
s =N-8, N-9 dan N-10

f4(s4x4) = cs,x4+f4(x4)
X4
S 11 12

8 f4(8,11) = c8,11 + f5(11) = 2 + 6 = 8* f 4(8,12) = c8,12 + f5(12) = 8 + 8 = 16

9 f 4(9,11) = c9,11 + f5(11) = 12 + 6 = 18 f 4(9,12) = c9,12 + f5(12) = 6 + 8 = 14*
10 f 4(10,11) = c10,11 + f5(11) = 6 + 6 = 12* f 4(10,12) = c10,12 + f5(12) = 6 + 8 = 14

Solusi Optimum
S f 4(s) X4
8 f 4(8) = f4(8,11) = 8* 11
9 f 4(9) = f4(9,12) = 14* 12
1
f 4(10) = f4(10,11) = 12* 11
0

X3 = N-8, N-9 dan N-10

s =N-5, N-6 dan N-7

f3(s3x3) = cs3x3+f3(x3)
X3
S 8 9 10
5 f3(5,8) = c5,8 + f4(8) = 2 + 8 = 10* f3(5,9) = c5,9 + f4(9) = 4 + 16 = 20 f3(5,10) = c5,10 + f4(10) = 6 + 12 = 18
6 f3(6,8) = c6,8 + f4(8) = 8 + 8 = 16* f3(6,9) = c6,9 + f4(9) = 4 + 16 = 20 f3(6,10) = c6,10 + f4(10) = 6 + 12 = 18
7 f3(7,8) = c7,8 + f4(8) = 5 + 8 = 13* f3(7,9) = c7,9 + f4(9) = 5 + 16 = 21 f3(7,10) = c7,10 + f4(10) = 5 + 12 = 17

Solusi Optimum
S f3(s) X3
5 f3(5) = f3(5,8) = 10* 8
6 f3(6) = f3(6,8) = 16* 8
7 f3(7) = f3(7,8) = 13* 8

Pemrosesan Tahap 2

X1 = N-5, N-6 dan N-7

s = N-2, N-3 dan N-4

f2(s2x2) = cs2x2+f3(x2)
X2
S 5 6 7

2 f2(2,5) = c5,5 +f3(5) = 14 + 10 = 24* f2(2,6) = c5,6 + f3(6) = 8 + 16 = 24* f2(2,7) = c5,7 + f3(7) = 12 + 13 = 25
3 f2(3,5) = c6,5 + f3(5) = 6 + 10 = 16* f2(3,6) = c6,6 + f3(6) = 4 + 16 = 20 f2(3,7) = c6,7 + f3(7) = 8 + 13 = 21
4 f2(4,5) = c7,5 + f3(5) = 8 + 10 = 18* f2(4,6) = c7,6 + f3(6) = 2 + 16 = 18* f2(4,7) = c7,7 + f3(7) = 10 + 13 = 23

Solusi Optimum
S F2(s) X2
2 f2(2) = f2(2,5) = f2(2,6) = 24* 5 dan 6
3 f2(3) = f2(3,5) = 16* 5
4 f2(4) = f2(4,5) = f2(4,6) = 18* 5 dan 6
 Pemrosesan Tahap 1

X1 = N-2, N-3 dan N-4

s = N-1

f1(s1x1) = cs1,x1+f2(X1)
X1
S 2 3 4

1 f1(1,2) = c1,2 + f2(2) = 4 + 24 = 28 f1(1,3) = c1,3 + f2(3) = 8 + 16 = 24* f1(1,4) = c1,4 + f2(4) = 6 + 18 = 24*

Solusi Optimum
S f1s) X1*
1 f1(1) = f1(1,3) = f1(1,4) = 24* 3 atau 4
Solusi optimal pada masing-masing tahapan
  Tahap 1 Tahap 2 Tahap 3 Tahap 4 Tahap 5 (Tujuan)
Awal x1* x2* x3* x4* x5*
1 3 atau 4 5 atau 6 8 11 13
    5 8 12 13
    5 atau 6 8 11  

Alternatif-alternatif Lintasan Terpendek dari N-1 ke N-13 adalah sebagai berikut

Alternati Lintasan Total biaya
f
1 N-1 → N-3 → N-5 → N-8 → N-11→ N-13 8 + 6 + 2 + 2 + 6 = 24*
2 N-1 → N-3 → N-5 → N-8 → N-12→ N-13 8 + 6 + 2 + 8 + 8 = 32
3 N-1 → N-3 → N-6 → N-8 → N-11→ N-13 8 + 4 + 8 + 2 + 6 = 28
4 N-1 → N-3 → N-6 → N-8 → N-12→ N-13 8 + 4 + 8 + 8 + 8 = 36
5 N-1 → N-4 → N-5 → N-8 → N-11→ N-13 6 + 8 + 2 + 2 + 6 = 24*
6 N-1 → N-4 → N-5 → N-8 → N-12→ N-13 6 + 8 + 2 + 8 + 8 = 32
7 N-1 → N-4 → N-6 → N-8 → N-11→ N-13 6 + 2 + 8 + 2 + 6 = 24*
8 N-1 → N-4 → N-6 → N-8 → N-12→ N-13 6 + 2 + 8 + 8 + 8 = 32

Kesimpulan: Tiga alternatif lintasan terpendek dari N-1 ke N-10 dengan biaya 24* adalah
Alternati Lintasan Total biaya
f
1 N-1 → N-3 → N-5 → N-8 → N-11→ N-13 8 + 6 + 2 + 2 + 6 = 24*
5 N-1 → N-4 → N-5 → N-8 → N-11→ N-13 6 + 8 + 2 + 2 + 6 = 24*
7 N-1 → N-4 → N-6 → N-8 → N-11→ N-13 6 + 2 + 8 + 2 + 6 = 24*