Sistem Operasi II

UJIAN TENGAH SEMESTER

Dr. Edwin Setiawan Nugraha

President University

(Teknik Industri-President University) Riset Operasi II 1 / 11

Outline

1 Pendahuluan

2 Principle of Optimmality

3 Forward and Backward

(Teknik Industri-President University) Riset Operasi II 2 / 11

Pendahuluan

Definition
Dynamic programming is a methodology useful for solving problems that
involve taking decisions over several stages in a sequence.

The dynamic programming approach divides the problem into several

sub-problems or stages and then these sub-problems are solved sequentially
until the initial problem is finally solved. The common characteristic of all
dynamic models is expressing the decision problem by means of a recursive
formulation (recursion means determination of a successive element by
operations on a preceding element according to a formula).

Sumber:
http://www.universalteacherpublications.com/univ/ebooks/or/Ch12/intro.htm

(Teknik Industri-President University) Riset Operasi II 3 / 11

Shortest-Route Problem

Thank to https://graphonline.ru/en/

(Teknik Industri-President University) Riset Operasi II 4 / 11

Solution
Bagi masalah menjadi 3 tahap:
Tahap 1:
Jarak terpendek dari node 0 ke node 1=7
Jarak terpendek dari node 0 ke node 2=8
Jarak terpendek dari node 0 ke node 3=5
Tahap 2:
for node 4;
     
Shortest distance Shortest distance distance from
= min { + }
to node 4 i=1,2,3 to node i node i to node 4
 
 7+12=19 
= min 8+8=16 = 12 (from node 4)
5+7=12
 

for node 5;
     
Shortest distance Shortest distance distance from
= min { + }
to node 5 i=2,3 to node i node i to node 5
 
8+9=17
= min = 17 (from node 2)
5+13=18
Ringkasan:
Jarak terpendek ke node 4=12 mil (dari node 3)
Jarak terpendek ke node 5=17 mil (dari node 2)
(Teknik Industri-President University) Riset Operasi II 5 / 11
Solution
Tahap 3:
   
Shortest distance 12+9=21
= min = 21 (from node 4)
to node 6 17+6=23

Ringkasan tahap 3: jarak terpendek ke node 6 = 21 mil dari node 4

(Teknik Industri-President University) Riset Operasi II 6 / 11

Principle of Optimality

Future decisions for the remaining stages will constitute on an optimal

policy regardless of the policy adopted in previous stages.

(Teknik Industri-President University) Riset Operasi II 7 / 11

Forward and Backward Recursion

Recursion equation for forward process

fi (xi ) = min {d(xi−1 , xi ), fi−1 (xi−1 )} (1)

(xi ,xi+1 )

fi (xi ) = the shortest distance to node xi at stage i

d(xi−1 , xi ) = distance from node xi−1 to node xi

Recursion equation for backward process

fi (xi ) = min {d(xi , xi+1 ), fi+1 (xi+1 )} (2)

(xi ,xi+1 )

fi (xi ) = the shortest distance to node xi at stage i

d(xi , xi+1 ) = distance from node xi to node xi+1

(Teknik Industri-President University) Riset Operasi II 8 / 11

Forward and Backward Recursion
Ada tiga bagian penting dalam menyelesaikan masalah menggunakan DP:
1 Stage (tahap) merupakan titik suatu kepautusan
2 State (Status) merupakan parameter masukan
3 Transformasi merupakan aturan yang mengarahkan keputusan
Langkah-langkah pemecahan masalah
1 Tentukan metode pemecahan (maju atau mundur)
2 Definisikan tahap (n)
3 Definisikan variabel status pada tiap tahap (Sn)
4 Definisikan variabel keputusan pada tiap tahap (Xn)
5 Definisikan hubungan rekursi
6 Lakukan perhitungan
7 Buat kesimpulan optimal

(Teknik Industri-President University) Riset Operasi II 9 / 11

Jarak Paling Pendek

Dikerjakan dalam MS. Excel

(Teknik Industri-President University) Riset Operasi II 10 / 11

Maksimasi Income

Sebuah perusahaan pupuk lokal mempunyai kapasitas produksi sebanyak

500 ton per bulan. Produk nya dipasarkan di 3 kota dengan keuntungan
masing-masing pasar diberikan pada tabel berikut

Jumlah produk (ton) Kota A Kota B Kota C

0 0 0 0
1 0,6 0,8 0,7
2 1,5 1,2 1,4
3 2,5 2,0 1,9
4 3,3 3,1 2,5
5 4,0 3,7 3,9

Bagaimana distribusi produk harus dilakukan agar perusahaan

mendapatkan untung yang maksimum?

(Teknik Industri-President University) Riset Operasi II 11 / 11