1ransporLaLlon roblem

onLenL
W Cenerlc Model
W lnlLlal SoluLlons
W vAM
W LeasL osL MeLhod
W Modl MeLhod
1ransporLaLlon roblem
W 1hls problem lnvolves Lhe shlpmenL of a
homogeneous producL from a number of supply
locaLlons Lo a number of demand locaLlons
W roblem glven needs aL Lhe demand locaLlons how should
we Lake llmlLed supply aL supply locaLlons and move Lhe
goods lurLher suppose we wlsh Lo mlnlmlze cosL
aslc oncepL
W Cb[ecLlve
Mlnlmlze cosL
W varlables
CuanLlLy of goods shlpped from each
Supply polnL Lo each demand polnL
W 8esLrlcLlons
non negaLlve shlpmenLs
Supply avallablllLy aL a supply polnL
uemand need aL a demand polnL
lormulaLlon of roblem
W Suppose Lhere are sources and desLlnaLlons
W LeL f

be Lhe number of supply unlLs avallable aL source

(123 m)
W LeL

be Lhe number of demand unlLs requlred aL

desLlnaLlon ( 1 2 3n)
W 1he LoLal number of varlables ls
W 1he LoLal number of consLralnLs ls +
W LeL n

represenL unlL LransporLaLlon cosL for LransporLlng

unlL from source Lo desLlnaLlon
W Je have deLermlne number of unlLs Lo be LransporLed
from source Lo desLlnaLlon so LhaL LoLal cosL of
LransporLaLlon ls mlnlmum
lormulaLlon of roblem conL
W LeL

be Lhe number of unlLs shlpped from source

Lo desLlnaLlon
W LeL f

be Lhe row LoLal supply

W LeL

be Lhe column LoLal demand

Mln %%n

sub[ecL Lo %

for each source

for each desLlnaLlon

for all and

alanced 1ransporLaLlon roblem
W 1he LoLal supply from all Lhe sources equals
Lhe LoLal demand ln all Lhe desLlnaLlons
ln case of balanced LransporLaLlon problem all consLralnLs
are epressed as equaLlons le Lhere ls no lnequallLy
ample 1
|ant D|str|but|on Centres
Supp|y
(m||||on
||tres)
1 2 3 4
1 2 3 11 7 6
2 1 1 1
3 3 8 13 9 10
Demand
7 S 3 2
17
A dalry flrm has Lhree planLs and four dlsLrlbuLlon cenLers 1he dally producLlon capaclLy
and demand aL each dlsLrlbuLlon cenLre ls glven ln Lhe Lable below 1he cosL shlpplng of
one mllllon llLres of mllk from planL Lo dlsLrlbuLlon cenLre ls also glven ln hundreds of
rupees
lormulaLlon SLep 1
Pere

are Lhe declslon varlables le Lhe quanLlLles of mllk Lo

be shlpped from dlfferenL planLs Lo dlfferenL dlsLrlbuLlon
cenLres
Jhen 123 and 1 2 34
and

lormulaLlon SLep 2
W Mlnlmlze Lhe ob[ecLlve funcLlon le
Mlnlmlze Z 2

+ 3

+ 11

+ 7

+ 3

+ 8

+ 13

+ 9

W ln general we can wrlLe

Mln %%n

lormulaLlon SLep 3
W Pere consLralnLs are Lhe supply of mllk ls llmlLed So
W Pere consLralnLs are Lhe demand of mllk
Solvlng 1ransporLaLlon roblem
W 1he LransporLaLlon problem ls solved ln Lwo phases
hase l CbLalnlng an lnlLlal feaslble soluLlon
hase ll Movlng Loward opLlmallLy
W ln hase l
norLhJesL orner 8ule
1he LeasLosL MeLhod
8ow Mlnlma MeLhod
olumn Mlnlma MeLhod
vogel's ApprolmaLlon MeLhod (vAM)
W ln hase ll
1he SLepplng SLone MeLhod
1he MCul meLhod ( Modlfled ulsLrlbuLlon MeLhod)
norLhJesL orner 8ule
1 Asslgn largesL posslble allocaLlon Lo Lhe cell ln Lhe
upper lefLhand corner of Lhe Lableau
2 8epeaL sLep 1 unLll all allocaLlons have been
asslgned
3 SLop lnlLlal Lableau ls obLalned
4 1he proposed soluLlon ls feaslble soluLlon slnce all
demand and supply consLralnLs are fully saLlsfled
3 AsslgnmenL has been done wlLhouL conslderlng
cosL soluLlon may noL be Lhe besL or opLlmal
Lhe value of

can be Laken as zero when Lhey are

noL allocaLed ln any cell
7 A cell LhaL geLs an allocaLlon ls called a baslc cell
AllocaLlon of supply uslng nJ rule
2
6
3 11 7 6
1
1
1 1
3 8
S
13
3
9
2
10
7
1
S 3 2
17
ample 2 1ransporLaLlon 1ableau
17
norLhwesL corner
13
SLep 1
Ma (132)
SLep 2
13
3


13

123
AllocaLlon of supply uslng nJ rule
LeasL cosL MeLhod
Pere we use Lhe followlng sLeps
SLeps
SLep 1 llnd Lhe cell LhaL has Lhe leasL cosL
SLep 2 Asslgn as much as allocaLlon Lo Lhls cell
SLep 3 lock Lhose cells LhaL cannoL be allocaLed
SLep 4 8epeaL above sLeps unLll all allocaLlon have been
asslgned
ample 1AllocaLlon of supply uslng
LeasL osL MeLhod
2
6
3 11 7 6
1
1
1 1
3
1
8
4
13
3
9
2
10 9 S 2
7
1
S
4
3 2
17
21
ample 2 AllocaLlon of supply uslng LeasL osL MeLhod
SLep 1
1he mln cosL so allocaLe as much resource as posslble here
2
SLep 3
SLep 2
22
SLep 3
2

73
Second lLeraLlon sLep 4
(Lo p13)
ample 2 AllocaLlon of supply uslng
LeasL osL MeLhod cnL
23
ample 2 AllocaLlon of supply uslng
LeasL osL MeLhod cnL
1he lnlLlal soluLlon
W SLop 1he above Lableau ls an lnlLlal Lableau because
all allocaLlons have been asslgned
(Lo p8)
24
vogel's approlmaLlon meLhod
CperaLlonal sLeps
SLep 1 for each column and row deLermlne lLs
penalLy cosL by subLracLlng Lhelr Lwo of Lhelr
leasL cosL
SLep 2 selecL row/column LhaL has Lhe |gest pena|ty cost
ln sLep 1
SLep 3 asslgn as much as allocaLlon Lo Lhe
selecLed row/column LhaL has Lhe |east cost
SLep 4 lock Lhose cells LhaL cannoL be furLher allocaLed
SLep 3 8epeaL above sLeps unLll all allocaLlons have been
asslgned
23
subLracLlng Lhelr Lwo of Lhelr
leasL cosL
SLep 1
(8)
(117)
(34)
(4) (83) (111)
2
SLeps 2 3
PlghesL penalLy
cosL
Step 2
Step 3 Lhls has Lhe leasL cosL
27
SLep 4

28
SLep 3
Second lLeraLlon

29
3
rd
lLeraLlon of vAM

3
lnlLlal Lableau for vAM