MODEL TRANSPORTASI

Metode Pemecahan Masalah

1.

Tabel Awal

Aturan NWC (Nort West Corner) Metode INSPEKSI (Ongkos terkecil) Metode VAM (Vogel Approkximation Method)

2.

Tabel Optimum

Metode Steppingstone (batu loncatan) Metode MODI (Modified Distribution)

Learning Objectives
When you complete this module, you should be able to: Identify or Define:
Transportation modeling Facility location analysis

Learning Objectives
When you complete this module, you should be able to: Explain or Be Able to Use:
Northwest-corner rule Stepping-stone method

Transportation Modeling
An interactive procedure that finds the least costly means of moving products from a series of sources to a series of destinations
Can be used to help resolve distribution and location decisions

Transportation Modeling
A special class of linear programming
Need to know
1. The origin points and the capacity or supply per period at each 2. The destination points and the demand per period at each

3. The cost of shipping one unit from each origin to each destination

Transportation Problem
To From Des Moines Evansville Fort Lauderdale Albuquerque $5 $8 $9 Boston $4 $4 $7 Cleveland $3 $3 $5

Table C.1

Transportation Problem
Des Moines (100 units capacity) Cleveland (200 units required) Boston (200 units required)

Albuquerque (300 units required)

Evansville (300 units capacity) Fort Lauderdale (300 units capacity)

Figure C.1

Transportation Matrix
Figure C.2 To From Des Moines Albuquerque Boston Cleveland Factory capacity Des Moines capacity constraint Cell representing a possible source-todestination shipping assignment (Evansville to Cleveland)

$5 $8 $9

$4 $4 $7

$3 $3 $5

100 300

Evansville

Fort Lauderdale Warehouse requirement

300 700

300

200

200

Cost of shipping 1 unit from Fort Lauderdale factory to Boston warehouse

Cleveland warehouse demand

Total demand and total supply

Northwest-Corner Rule
Start in the upper left-hand cell (or northwest corner) of the table and allocate units to shipping routes as follows:
1. Exhaust the supply (factory capacity) of each row before moving down to the next row

2.
3.

Exhaust the (warehouse) requirements of each column before moving to the next column
Check to ensure that all supplies and demands are met

Northwest-Corner Rule
1. Assign 100 tubs from Des Moines to Albuquerque (exhausting Des Moiness supply) Assign 200 tubs from Evansville to Albuquerque (exhausting Albuquerques demand) Assign 100 tubs from Evansville to Boston (exhausting Evansvilles supply) Assign 100 tubs from Fort Lauderdale to Boston (exhausting Bostons demand) Assign 200 tubs from Fort Lauderdale to Cleveland (exhausting Clevelands demand and Fort Lauderdales supply) 2. 3. 4. 5.

Northwest-Corner Rule
To From (D) Des Moines (A) Albuquerque (B) Boston (C) Cleveland Factory capacity

100 200

$5 $8 $9

$4 $4 $7

$3 $3 $5

100 300

(E) Evansville

100

(F) Fort Lauderdale Warehouse requirement

100 200

200 200

300 700

300

Figure C.3

Means that the firm is shipping 100 bathtubs from Fort Lauderdale to Boston

Northwest-Corner Rule
Computed Shipping Cost
Route From To D E E F F A A B B C Tubs Shipped 100 200 100 100 200 Cost per Unit $5 8 4 7 5 Total Cost $ 500 1,600 400 700 $1,000 Total: $4,200

This is a feasible solution but not necessarily the lowest cost alternative
Table C.2

Intuitive Lowest-Cost Method

1. Identify the cell with the lowest cost 2. Allocate as many units as possible to that cell without exceeding supply or demand; then cross out the row or column (or both) that is exhausted by this assignment

3. Find the cell with the lowest cost from the remaining cells
4. Repeat steps 2 and 3 until all units have been allocated

Intuitive Lowest-Cost Method

To From (D) Des Moines (A) Albuquerque (B) Boston (C) Cleveland

Factory capacity

$5 $8 $9

$4 $4 $7

100

$3 $3 $5

100
300 300 700

(E) Evansville

(F) Fort Lauderdale Warehouse requirement

300

200

200

First, $3 is the lowest cost cell so ship 100 units from Des Moines to Cleveland and cross off the first row as Des Moines is satisfied
Figure C.4

Intuitive Lowest-Cost Method

To From (D) Des Moines (A) Albuquerque (B) Boston (C) Cleveland

Factory capacity

$5 $8 $9

$4 $4 $7

100 100

$3 $3 $5

100
300 300 700

(E) Evansville

(F) Fort Lauderdale Warehouse requirement

300

200

200

Second, $3 is again the lowest cost cell so ship 100 units from Evansville to Cleveland and cross off column C as Cleveland is satisfied
Figure C.4

Intuitive Lowest-Cost Method

To From (D) Des Moines (A) Albuquerque (B) Boston (C) Cleveland

Factory capacity

$5 $8 $9

$4 $4 $7

100 100

$3 $3 $5

100
300 300 700

(E) Evansville

200

(F) Fort Lauderdale Warehouse requirement

300

200

200

Third, $4 is the lowest cost cell so ship 200 units from Evansville to Boston and cross off column B and row E as Evansville and Boston are satisfied
Figure C.4

Intuitive Lowest-Cost Method

To From (D) Des Moines (A) Albuquerque (B) Boston (C) Cleveland

Factory capacity

$5 $8 $9

$4 $4 $7

100 100

$3 $3 $5

100
300 300 700

(E) Evansville

200

(F) Fort Lauderdale Warehouse requirement

300 300

200

200

Finally, ship 300 units from Albuquerque to Fort Lauderdale as this is the only remaining cell to complete the allocations
Figure C.4

Intuitive Lowest-Cost Method

To From (D) Des Moines (A) Albuquerque (B) Boston (C) Cleveland

Factory capacity

$5 $8 $9

$4 $4 $7

100 100

$3 $3 $5

100
300 300 700

(E) Evansville

200

(F) Fort Lauderdale Warehouse requirement

300 300

200

200

Total Cost

= $3(100) + $3(100) + $4(200) + $9(300) = $4,100

Figure C.4

Intuitive Lowest-Cost Method

To From (A) Albuquerque (B) Boston (C) Cleveland

Factory capacity

(D) Des Moines improvement over the previous solution, (E) Evansville

$5 This is a feasible solution, and an

$4 $4 $7

100 100

$3 $3 $5

100
300 300 700

but not necessarily the lowest cost $8 alternative $9

200

(F) Fort Lauderdale Warehouse requirement

300 300

200

200

Total Cost

= $3(100) + $3(100) + $4(200) + $9(300) = $4,100

Figure C.4

Metode Pemecahan Masalah

1.

Tabel Awal

Aturan NWC (Nort West Corner) Metode INSPEKSI (Ongkos terkecil) Metode VAM (Vogel Approkximation Method)

2.

Tabel Optimum

Metode Steppingstone (batu loncatan) Metode MODI (Modified Distribution)

Matriks:

Keterangan: Ai = Daerah asal sejumlah i Si = Supply, Ketersediaan barang yang diangkut di i daerah asal Tj = Tempat tujuan sejumlah j dj = Permintaan (demand) barang di sejumlah j tujuan xij = Jumlah barang yang akan diangkut dari Ai ke Tj cij = Besarnya biaya transport untuk 1 unit barang dari Ai ke Tj Biaya transport = cij . xi Jumlah permintaan = Jumlah ketersediaan

METODE NWC (North West Corner)

Merupakan metode untuk menyusun tabel awal dengan cara mengalokasikan distribusi barang mulai dari sel yang terletak pada sudut paling kiri atas.

Aturannya: (1) Pengisian sel/kotak dimulai dari ujung kiri atas. (2) Alokasi jumlah maksimum (terbesar) sesuai syarat sehingga layak untuk memenuhi permintaan. (3) Bergerak ke kotak sebelah kanan bila masih terdapat suplai yang cukup. Kalau tidak, bergerak ke kotak di bawahnya sesuai demand. Bergerak terus hingga suplai habis dan demand terpenuhi.

Contoh Soal: Suatu perusahaan mempunyai 3 pabrik produksi dan 5 gudang penyimpanan hasil produksi. Jumlah barang yang diangkut tentunya tidak melebihi produksi yang ada sedangkan jumlah barang yang disimpan di gudang harus ditentukan jumlah minimumnya agar gudang tidak kosong. Tabel matriks berikut menunjukkan jumlah produksi paling banyak bisa diangkut, jumlah minimum yang harus disimpan di gudang dan biaya angkut per unit barang. Dalam smu (satuan mata uang):

Prosedur Penyelesaian:

- Isikan kolom mulai kolom di kiri atas (north west) dengan mempertimbangkan batasan persediaan dan permintaannya.
- Selanjutnya isikan pada kolom di sebelah kanannya hingga semua permintaan terpenuhi.

Pabrik/ Gudang
P1 P2 P3 d

G1
50 400 40 0 80 0 400

G2
80 400 70 0 40 0 400

G3
60 0 70 500 60 0 500

G4
60 0 60 100 60

G5
30 0 50 0 40

S
800 600 1100

300 400

800 800

Biaya total: Z = (50) 400 + (80) 400 + (70) 500 + (60) 100 + (60) 300 + (40) 800 = 143.000

Metode Inpeksi (Matrik Minimum)

Merupakan metode untuk menyusun tabel awal dengan cara pengalokasian distribusi barang dari sumber ke tujuan mulai dari sel yang memiliki biaya distribusi terkecil Aturannya 1. Pilih sel yang biayanya terkecil 2. Sesuaikan dengan permintaan dan kapasitas 3. Pilih sel yang biayanya satu tingkat lebih besar dari sel pertama yang dipilih 4. Sesuaikan kembali, cari total biaya

Contoh
Pabrik/ Gudang P1 G1 50 0 P2 40 400 P3 80 0 d 400 G2 80 0 70 0 40 G3 60 0 70 G4 60 0 60 200 60 200 400 G5 30 800 50 0 40 1100 600 S 800

0
60 500 500

400
400

0
800

 Biaya Total = (800 x 30) + (400 x 40) + (400 x 40) + (60 x 200) + (60 x 500) + (60 x 200) = 110.000

Metode VAM (Vogel Approkximation Method )

Metode VAM lebih sederhana penggunaanaya, karena tidak memerlukan closed path (jalur tertutup). Metode VAM dilakukan dengan cara mencari selisih biaya terkecil dengan biaya terkecil berikutnya untuk setiap kolom maupun baris. Kemudian pilih selisih biaya terbesar dan alokasikan produk sebanyak mungkin ke sel yang memiliki biaya terkecil. Cara ini dilakukan secara berulang hingga semua produk sudah dialokasikan .

Prosedur Pemecahan:

(1) Hitung perbedaan antara dua biaya terkecil dari setiap baris dan kolom.
(2) Pilih baris atau kolom dengan nilai selisih terbesar, lalu beri tanda kurung. Jika nilai pada baris atau kolom adalah sama, pilih yang dapat memindahkan barang paling banyak. (3) Dari baris/kolom yang dipilih pada (2), tentukan jumlah barang yang bisa terangkut dengan memperhatikan pembatasan yang berlakubagi baris atau kolomnya serta sel dengan biaya terkecil. (4) Hapus baris atau kolom yang sudah memenuhi syarat sebelumnya (artinya suplai telah dapat terpenuhi). (5) Ulangi langkah (1) sampai (4) hingga semua alokasi terpenuhi.

Contoh Soal
Pabrik/ Gudang P1 G1 50 G2 80 0 70 0 40 400 d I 400
50- 40 = 10

G3 60

G4 60

G5 30

S 800

50 30 = 20 50 40 = 10

P2

40

70

60

50

600

P3

80

60

60

40

1100

40 40 = 0

400
70 40 = 30

500
60 60 = 0

400

800

60 60 = 40 30= 0 10

Terbesar

Pabrik/ Gudan g P1

G1

G2

G3

G4

G5

II

50 0

80 0 70 0

60 0 70

60 0 60

30 800 50 0

800

50-30= 20

P2

40

600

50-40= 10

P3

80

40 400

60

60

40 0

1100 (700)

60-40= 20

d II

400
50-40= 10

400 0

500
60-60= 0

400
60-60= 0

800
40-30= 10

Pabrik/ Gudang P1

G1

G2

G3

G4

G5

III

50 0

80 0 70 0 40 400

60 0 70

60 0 60

30 800 50 0

800

P2

40 400

600 200 1100 (700)

60-40= 30 60-60= 0

P3

80 0

60

60

40 0

d
III

400
80-40= 40

400
0

500
70-60= 10

400
60-60= 10

800
0

Pabrik/ Gudang P1

G1 50 0

G2 80 0 70

G3 60 0 70 0

G4 60

G5 30 800 50 0

S 800

IV 0

0
60 200

P2

40 400

0 40
400 400

600 (200)

70-60= 10

P3

80
0

60
500 500
70-60= 10

60
200 400
60-60= 10

40
0 800

1100 (700)

60-60= 0

400

IV

 Biaya Total = (400.40) + (800.30) + (400.40) + (500.60) + (200.60) + (200.60) = 110.000