Lokasi Perusahaan

Metoda Transportasi
 Transportasi:
Perpindahan barang dari satu tempat ke tempat lain atau
dari beberapa tempat ke beberapa tempat lain
Transportasi:
Resources
tempat asal barang

Destinations
tempat tujuan barang
 tempat tujuan
(destination)

tempat asal
(source)
 Transportasi:
A K

B L tempat tujuan
(destination)

C M

D N
tempat asal
(source)
Mengirim barang dari satu tempat ke tempat lain

Alat transportasi

Biaya pengiriman

Total biaya
Model Transportasi: del
Transportasi:
Mencari dan menentukan perencanaan pengiriman barang dari tempat
asal ke tempat tujuan, dengan total biaya transportasi yang minimal
 Total Biaya Transportasi:
Jumlah barang yang tersedia di tempat asal,
yakni kapasitas pengiriman

Daya tampung di daerah atau tempat tujuan,

yakni daya tampung tempat tujuan

Biaya transportasi per unit yang akan

dikirimkan
Solusi Model Transportasi
Solusi Awal:
Northwest Corner Method
Minimum Cell Cost Method
Vogel’s Approximation

Solusi Optimal:
Stepping Stone Method
Modified Distribution Method
Prosedur Penyelesaian Metode Transportasi:
Menyusun Matriks Transportasi

Menyusun Tabel Awal

Alokasi : Solusi Awal

Ya
Test Optimalisasi
: Solusi Optimal Selesai

Tidak
Revisi
 Formulasi Model LP:
Fungsi Tujuan:
Minimisasi
Z= 6 X1A + 8X1B + 10X1C + 7X2A + 11X2B + 11X2C + 4X3A + 5X3B + 12X3C

Fungsi Batasan:
X1A + X1B + X1C = 150 Penawaran
X2A + X2B + X2C = 175
X3A + X3B + X3C = 275
X1A + X2A + X3A = 200
Permintaan
X1B + X2B + X3B = 100
X1C + X2C + X3C = 300
Xij ≥ 0
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 Albuquerque Boston Cleveland
Des Moines $5 $4 $3
Evansville $8 $4 $3
Fort Lauderdale $9 $7 $5

Table C.1
Transportation Problem
Boston
Cleveland (200 units
(200 units required)
Des Moines required)
(100 units
capacity)

Albuquerque
(300 units
required) Evansville
(300 units
capacity)

Fort Lauderdale
(300 units
Figure C.1 capacity)
 Transportation Matrix
Figure C.2
To Factory Des Moines
Albuquerque Boston Cleveland capacity capacity
From constraint
$5 $4 $3
Des Moines 100
Cell
representing
$8 $4 $3 a possible
Evansville 300 source-to-
destination
$9 $7 $5 shipping
Fort Lauderdale 300 assignment
(Evansville to
Cleveland)
Warehouse
requirement 300 200 200 700

Cost of shipping 1 unit from Fort Cleveland Total demand

Lauderdale factory to Boston warehouse warehouse 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. Exhaust the (warehouse) requirements of
each column before moving to the next
column
3. Check to ensure that all supplies and
demands are met
Northwest-Corner Rule
1. Assign 100 tubs from Des Moines to Albuquerque
(exhausting Des Moines’s supply)
2. Assign 200 tubs from Evansville to Albuquerque
(exhausting Albuquerque’s demand)
3. Assign 100 tubs from Evansville to Boston
(exhausting Evansville’s supply)
4. Assign 100 tubs from Fort Lauderdale to Boston
(exhausting Boston’s demand)
5. Assign 200 tubs from Fort Lauderdale to Cleveland
(exhausting Cleveland’s demand and Fort
Lauderdale’s supply)
 Northwest-Corner Rule
To (A) (B) (C) Factory
From Albuquerque Boston Cleveland capacity
$5 $4 $3
(D) Des Moines 100 100

$8 $4 $3
(E) Evansville 200 100 300

$9 $7 $5
(F) Fort Lauderdale 100 200 300

Warehouse
requirement 300 200 200 700

Means that the firm is shipping 100 bathtubs

Figure C.3 from Fort Lauderdale to Boston
Northwest-Corner Rule
Computed Shipping Cost
Route
From To Tubs Shipped Cost per Unit Total Cost
D A 100 $5
$ 500
E A 200 8
1,600
E B 100 4
400
F B 100 7
700 This is a feasible solution
F C but not necessarily the 5
200
Table C.2
$1,000 lowest cost alternative

Total: $4,200
 Latihan: Model Transportasi
Perusahaan pupuk memiliki 3 gudang produk di Solo, Klaten dan
Temanggung. Kapasitas masing-masing adalah: 130 ton dan 120 ton.
Dari kedua gudang dilayani pasar konsumen di Magelang, Salatiga,
dan Semarang, dengan permintaan setiap kota adalah: 50 ton, 50 ton
dan 100 ton. Biaya angkut per ton dari setiap gudang ke setiap pasar
layanan adalah (dalam satuan ribuan Rp):

dari: Semarang Magelang Salat20iga

Ke:
Klaten 10 15 15
Temanggung 5 6 20
Solo 15 10 15