1

IEI2G3 – Penelitian Operasional 1

Transshipment

S1 Teknik Industri – Fakultas Rekayasa Industri

 2

TUJUAN PEMBELAJARAN

Mahasiswa mampu mendapatkan solusi optimal

masalah transshipment
 3

TRANSSHIPMENT

• Model transshipment melihat bahwa mungkin lebih murah untuk melakukan pengiriman
melalui titik antara (transient nodes) sebelum mencapai tujuan akhir.
• Konsep ini lebih umum daripada model transportasi biasa, di mana pengiriman hanya
diperbolehkan secara langsung antara sumber dan tujuan.
• Sebuah model transshipment dapat dikonversi (dan dipecahkan sebagai) model
transportasi biasa.
 4

CONTOH 5.5-1 (TAHA)

Dua pabrik mobil, P1 dan P2, terhubung dengan

tiga dealer, D1, D2, dan D3, melalui dua titik transit,
T1 dan T2. Jumlah pasokan di pabrik P1 dan P2
masing-masing adalah 1000 dan 1200 mobil.
Jumlah permintaan di dealer D1, D2, dan D3,
adalah 800, 900, dan 500 mobil. Biaya pengiriman
per mobil (dalam ratusan dolar) antara pasangan
node ditunjukkan pada link yang menghubungkan
(atau busur) jaringan.
 5

JENIS NODE PADA MASALAH TRANSSHIPMENT

Jenis-jenis node:

Transshipment node
• Node yang bertindak sebagai sumber dan tujuan
• T1, T2, D1, D2
Pure supply node
• Node yang hanya bertindak sebagai sumber
• P1, P2
Pure demand node
• Node yang hanya bertindak sebagai tujuan
• D3
 6
TRANSFORMASI MASALAH TRANSSHIPMENT MENJADI
MODEL TRANSPORTASI

• Permasalahan di samping dapat diselesaikan

menggunakan model transportasi dengan 6 sumber
(P1, P2, T1, T2, D1, D2) dan 5 tujuan (T1, T2, D1, D2,
D3)
• Jumlah pasokan pada pure supply node
Pasokan pure supply = pasokan awal
Pasokan P1 = pasokan awal = 1000
Pasokan P2 = pasokan awal =1200
• Jumlah permintaan pada pure demand node
Demand pure demand node = demand awal
Demand D3 = permintaan awal = 500
 7
TRANSFORMASI MASALAH TRANSSHIPMENT MENJADI
MODEL TRANSPORTASI

• Jumlah pasokan pada transshipment node

Pasokan transshipment node = pasokan awal + buffer
Buffer = total pasokan = 1000 + 1200 = 2200
Pasokan T1 = 0+2200 = 2200
Pasokan T2 = 0+2200 = 2200
Pasokan D1 = 0+2200 = 2200
Pasokan D2 = 0+2200 = 2200
• Jumlah permintaan pada transshipment node
Permintaan transshipment node = permintaan awal + buffer
Buffer = total permintaan = 800+900+500 = 2200
permintaan T1 = 0+2200 = 2200
permintaan T2 = 0+2200 = 2200
permintaan D1 = 800+2200 = 3000
permintaan D2 = 900+2200 = 3100
 8
TRANSFORMASI MASALAH TRANSSHIPMENT MENJADI
MODEL TRANSPORTASI

• Jumlah pasokan pada transshipment node

Pasokan transshipment node = pasokan awal + buffer
Buffer = total pasokan = 1000 + 1200 = 2200
Pasokan T1 = 0+2200 = 2200
Pasokan T2 = 0+2200 = 2200
Pasokan D1 = 0+2200 = 2200
Pasokan D2 = 0+2200 = 2200
• Jumlah permintaan pada transshipment node
Permintaan transshipment node = permintaan awal + buffer
Buffer = total permintaan = 800+900+500 = 2200
permintaan T1 = 0+2200 = 2200
permintaan T2 = 0+2200 = 2200
permintaan D1 = 800+2200 = 3000
permintaan D2 = 900+2200 = 3100
 9

TABEL TRANSPORTASI

T1 T2 D1 D2 D3
P1

P2

T1

T2 Jumlah baris = pure supply node + transhipment node

(P1, P2) (T1, T2, D1, D2)
Jumlah baris = 6 baris
D1
Jumlah kolom = pure demand node + transhipment node
(D3) (T1, T2, D1, D2)
D2 Jumlah kolom = 5 kolom
 10

TABEL TRANSPORTASI

T1 T2 D1 D2 D3 Pasokan:
•Pasokan P1 = pasokan awal = 1000
P1 1000 •Pasokan P2 = pasokan awal = 1200
•Pasokan T1 = 0+2200 = 2200
•Pasokan T2 = 0+2200 = 2200
P2 1200 •Pasokan D1 = 0+2200 = 2200
•Pasokan D2 = 0+2200 = 2200

T1 2200

T2 2200
Permintaan
•permintaan T1 = 0+2200 = 2200
2200 •permintaan T2 = 0+2200 = 2200
D1
•permintaan D1 = 800+2200 = 3000
•permintaan D2 = 900+2200 = 3100
2200 •Demand D3 = permintaan awal = 500
D2

2200 2200 3000 3100 500

 11

TABEL TRANSPORTASI

T1 T2 D1 D2 D3
P1 3 4 M M M 1000

P2 2 5 M M M 1200

T1 0 7 8 6 M 2200

T2 M 0 M 4 9 2200 Biaya T1D3 = M (bilangan sangat besar)

Karena berdasarkan gambar jaringan di
atas, tidak ada jalur yang menghubungkan
D1 M M 0 5 M 2200 T1 ke D3 secara langsung

D2 M M M 0 3 2200

2200 2200 3000 3100 500

 12

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M
1000 4-3=1

P2 2 5 M M M
1200 5-2=3

T1 0 7 8 6 M
2200 6-0=6

T2 M 0 M 4 9
2200 4-0=4

D1 M M 0 5 M
2200 5-0=5
2200
D2 M M M 0 3
2200 3-0=3

2200 2200 3000 3100 500

2-0=2 4-0=4 8-0=8 4-0=4 9-3=6
 13

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3

T1 0 7 8 6 M 2200 6-0=6
800

T2 M 0 M 4 9 2200 4-0=4

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 2200 3-0=3

2200 2200 800 3100 500

2-0=2 4-0=4 M-8 4-0=4 9-3=6
 14

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3

T1 0 7 8 6 M 1400 6-0=6
1400 800

T2 M 0 M 4 9 2200 4-0=4

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 2200 3-0=3

2200 2200 0 3100 500

2-0=2 4-0=4 - 4-0=4 9-3=6
 15

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3

T1 0 7 8 6 M 0 -
1400 800

T2 M 0 M 4 9 2200 4-0=4

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 2200 3-0=3
500

800 2200 0 3100 500

1 4-0=4 - 4-0=4 9-3=6
 16

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3

T1 0 7 8 6 M 0 -

1400 800

T2 M 0 M 4 9 2200 4-0=4

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 1700 M-0=M
1700 500

800 2200 0 3100 0

1 4-0=4 - 4-0=4 -
 17

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3

T1 0 7 8 6 M 0 -

1400 800

T2 M 0 M 4 9 2200 4-0=4
1400

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 0 -
1700 500

800 2200 0 1400 0

1 4-0=4 - M-4 -
 18

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3

T1 0 7 8 6 M 0 -

1400 800

T2 M 0 M 4 9 800 M-0=M
800 1400

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 0 -
1700 500

800 2200 0 0 0
1 4-0=4 - - -
 19

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

P2 2 5 M M M 1200 5-2=3
800

T1 0 7 8 6 M 0 -

1400 800

T2 M 0 M 4 9 0 -
800 1400

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 0 -
1700 500

800 1400 0 0 0
1 4-5=1 - - -
 20

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

1000

P2 2 5 M M M 400 5-2=3
800

T1 0 7 8 6 M 0 -

1400 800

T2 M 0 M 4 9 0 -
800 1400

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 0 -
1700 500

0 1400 0 0 0
- 4-5=1 - - -
 21

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M 1000 4-3=1

1000

P2 2 5 M M M 400 5-2=3
800 400

T1 0 7 8 6 M 0 -

1400 800

T2 M 0 M 4 9 0 -
800 1400

D1 M M 0 5 M 0 -

2200
D2 M M M 0 3 0 -
1700 500

0 400 0 0 0
- 4-5=1 - - -
 22

SOLUSI BASIS LAYAK AWAL (VAM)

T1 T2 D1 D2 D3
P1 3 4 M M M
0
1000
P2 2 5 M M M
0
800 400
T1 0 7 8 6 M
0
1400 800
T2 M 0 M 4 9
0
800 1400
D1 M M 0 5 M
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 23

SOLUSI BASIS LAYAK AWAL (VAM)

D1 800
T1 T2 D1 D2 D3
P1 3 4 M M M
1000 P1 T1
1000
D2 1400
900
P2 2 5 M M M
1200
800 400 500
P2 T2
T1 0 7 8 6 M 400
2200 D3 500
1400 800
T2 M 0 M 4 9
2200 Total biaya Z = 1000(4) + 800(2) +
800 1400
400(5) + 1400(0) + 800(8) + 800(0) +
D1 M M 0 5 M 1400(4) +2200(0) + 1700(0) +500(3)
2200 = 21100
2200
D2 M M M 0 3
2200
1700 500
2200 2200 3000 3100 500
 24

CEK OPTIMALITAS (STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M C11 = 3 – 4 + 5 – 2 = 2
0
1000
P2 2 5 M M M
0
800 400
T1 0 7 8 6 M
0
1400 800
T2 M 0 M 4 9
0
800 1400
D1 M M 0 5 M
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 25

CEK OPTIMALITAS (STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M C11 = 3 – 4 + 5 – 2 = 2
0 C13 = M – 8 + 0 – 2 + 5 – 4 = M - 9
1000
P2 2 5 M M M
0
800 400
T1 0 7 8 6 M
0
1400 800
T2 M 0 M 4 9
0
800 1400
D1 M M 0 5 M
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 26
CEK OPTIMALITAS (STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M C11 = 3 – 4 + 5 – 2 = 2
0 C13 = M - 8 + 0 - 2 + 5 - 4 = M - 9
1000 C14 = M - 4 + 0 - 4 = M - 8
P2 2 5 M M M C15 = M - 3 + 0 - 4 + 0 - 4 = M - 11
0 C23 = M - 8 + 0 - 2 = M - 10
800 400 C24 = M - 4 + 0 - 5 = M - 9
C25 = M - 3 + 0 - 4 + 0 - 5 = M - 12
T1 0 7 8 6 M C32 = 7 - 5 + 2 - 0 = 4
0
1400 800 C34 = 6 - 4 + 0 - 5 + 2 - 0 = -1 Belum optimal
C35 = M - 3 + 0 - 4 + 0 - 5 + 2 - 0 = M - 10
T2 M 0 M 4 9 C41 = M - 0 + 5 - 2 = M + 3
0 C43 = M - 0 + 5 - 2 + 0 - 8 = M - 5
800 1400
C45 = 9 - 3 + 0 - 4 = 2
D1 M M 0 5 M C51 = M - 0 + 8 - 0 = M + 8
0 C52 = M - 0 + 8 - 0 + 2 - 5 = M + 5
2200 C54 = 5 - 4 + 0 - 5 + 2 - 0 + 8 - 0 = 6
D2 M M M 0 3 C55 = M - 3 + 0 - 4 + 0 - 5 + 2 - 0 + 8 - 0 = M - 2
0 C61 = M - 0 + 4 - 0 + 5 - 2 = M + 7
1700 500 C62 = M - 0 + 4 - 0 = M + 4
C63 = M - 0 + 4 - 0 + 5 - 2 + 0 - 8 = M - 1
0 0 0 0 0
 27
PERBAIKI SOLUSI (STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M C11 = 3 – 4 + 5 – 2 = 2
0 C13 = M - 8 + 0 - 2 + 5 - 4 = M - 9
1000 C14 = M - 4 + 0 - 4 = M - 8
P2 2 5 M M M C15 = M - 3 + 0 - 4 + 0 - 4 = M - 11
0 C23 = M - 8 + 0 - 2 = M - 10
800 400 C24 = M - 4 + 0 - 5 = M - 9
C25 = M - 3 + 0 - 4 + 0 - 5 = M - 12
T1 0 7 8 6 M C32 = 7 - 5 + 2 - 0 = 4
0
1400 800 C34 = 6 - 4 + 0 - 5 + 2 - 0 = -1 Belum optimal
C35 = M - 3 + 0 - 4 + 0 - 5 + 2 - 0 = M - 10
T2 M 0 M 4 9 C41 = M - 0 + 5 - 2 = M + 3
0 C43 = M - 0 + 5 - 2 + 0 - 8 = M - 5
800 1400
C45 = 9 - 3 + 0 - 4 = 2
D1 M M 0 5 M C51 = M - 0 + 8 - 0 = M + 8
0 C52 = M - 0 + 8 - 0 + 2 - 5 = M + 5
2200 C54 = 5 - 4 + 0 - 5 + 2 - 0 + 8 - 0 = 6
D2 M M M 0 3 C55 = M - 3 + 0 - 4 + 0 - 5 + 2 - 0 + 8 - 0 = M - 2
0 C61 = M - 0 + 4 - 0 + 5 - 2 = M + 7
1700 500 C62 = M - 0 + 4 - 0 = M + 4
C63 = M - 0 + 4 - 0 + 5 - 2 + 0 - 8 = M - 1
0 0 0 0 0
 28
PERBAIKI SOLUSI(STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M θ = Min(1400,400,1400) = 400
0
1000
P2 2 5 M M M
0
800 400
T1 0 7 8 6 M
0
1400 800
T2 M 0 M 4 9
0
800 1400
D1 M M 0 5 M
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 29
CEK OPTIMALITAS (STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M θ = Min(1400,400,1400) = 400
0
1000 X22 keluar basis
P2 2 5 M M M
0
1200 0
T1 0 7 8 6 M
0
1000 800 400
T2 M 0 M 4 9
0
1200 1000
D1 M M 0 5 M
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 30
SOLUSI BARU

T1 T2 D1 D2 D3
P1 3 4 M M M θ = Min (1400,400,1400) = 400
0
1000 X22 keluar basis
P2 2 5 M M M
0
1200 0
T1 0 7 8 6 M
0
1000 800 400
T2 M 0 M 4 9
0
1200 1000
D1 M M 0 5 M
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 31
CEK OPTIMALITAS 2 (STEPPING STONE)

T1 T2 D1 D2 D3
P1 3 4 M M M C11 = 3 - 4 + 0 - 4 + 6 - 0 = 1
0 C13 = M - 4 + 0 - 4 + 6 - 8 = M - 10
1000 C14 = M - 4 + 0 - 4 = M - 8
C15 = M - 3 + 0 - 4 + 0 - 4 = M - 11
P2 2 5 M M M C22 = 5 - 0 + 4 - 6 + 0 - 2 = 1
0
1200 0 C23 = M - 8 + 0 - 2 = M - 10
C24 = M - 6 + 0 - 2 = M - 8
T1 0 7 8 6 M C25 = M - 3 + 0 - 6 = M - 9
0 C32 = 7 - 6 + 4 - 0 = 5
1000 800 400
C35 = M - 3 + 0 - 6 = M - 9
T2 M 0 M 4 9 C41 = M - 4 + 6 - 0 = M + 2
0 C43 = M - 4 + 6 - 8 = M - 6
1200 1000 C45 = 9 - 3 + 0 - 4 = 2
D1 M M 0 5 M C51 = M - 0 + 8 - 0 = M + 8
0 C52 = M - 0 + 8 - 6 + 4 - 0 = M + 6
2200 C54 = 5 - 6 + 8 - 0 = 7
C55 = M - 3 + 0 - 6 + 8 - 0 = M - 1
D2 M M M 0 3 C61 = M - 0 + 6- 0 = M + 6
0
1700 500 C62 = M - 0 + 4 - 0 = M + 4
C63 = M - 0 + 6 - 8 = M - 2
0 0 0 0 0
OPTIMAL
 32
KESIMPULAN (STEPPING STONE)

D1 800
T1 T2 D1 D2 D3
P1 3 4 M M M P1 T1
0
1000
D2 900
400
1400
P2 2 5 M M M
0 500
1200 0 P2 T2

T1 0 7 8 6 M
D3 500
0
1000 800 400
T2 M 0 M 4 9
0 Total biaya Z = 1000(4) + 1200(2) +
1200 1000 1000(5) + 800(8) + 400(6)+ 1200(0)
+ 1000(4) +2200(0) + 1700(0)
D1 M M 0 5 M +500(3) = 20700
0
2200
D2 M M M 0 3
0
1700 500
0 0 0 0 0
 33

TERIMA KASIH

33