(4) Transportation

Method
Special method.
• Transportation
Problems and
Method to solve such
problems
 Transportation Problem Cases
Destination (Warehouse)
12 . . n
1 a1
2 a2 Cij
. . Pij
.
nigirO

m am
b1 b2 . . bn
• Cij = Cost of shipping unit item from
ith Origin to j Destination
th
Categories of Transportation
Problems
A. Balanced Minimization → with
Cij
B. Unbalanced Minimization → with
Cij
C. Balanced Maximization → with
Pij
D. Unbalanced Maximization → with
Pij
 A. Balanced Minimization Problem
Destinations(Warehouses)
1 2 . . n a1
1
2 a2
tnalP(snigirO

. .
. am
m
b1 b2 . . bn
• Xij = No. ofth items shipped from ith Origin
to j Destination
Formulation of Transportation Problem
as LPP
Methods to get IBFS (Initial Basic Feasible
Solution)
1. NWCM: North West Corner Method
2. RMM: Row Minima Method
3. CMM: Column Minima Method
4. MMM: Matrix Minima Method
(Least Cost Entry Method)
5. VAM: Vogel’s Approximate
NWC
M
1 2 3 4 5
1 3 2 5 2
2 2 6 5 13 11 5
3 2 10 12 10
3
10 2 4 6 7 30
2
Therefore NWCM solution is :
1 2 3 4 5
1 3 2 5
2 2 6 5 13
3 2 10 12
10 3 4 6 7 30
Z=
148
RM
M 1 2 3 4 5
1 5 5
2 1 2 10 13 3 1
3 3 3 6 12 6 3
10 3 4 6 7 30
3 2 Z=
85
Therefore RMM solution is :
1 2 3 4 5
1 5 5
2 1 2 10 13
3 3 3 6 12
10 3 4 6 7 30
Z=
85
CM
M 1 2 3 4 5
1 3 2 5 2
2 2 7 4 13 11 4
3 6 6 12 6
3
10 24 6 7 30
6 Z=
108
Therefore CMM solution is :
1 2 3 4 5
1 3 2 5
2 2 7 4 13
3 6 6 12
10 3 4 6 7 30
Z=
108
MM
M 1 2 3 4 5
1 5 5
2 1 2 10 13 3 1
3 3 3 6 12 6 3
10 3 4 6 7 30
3 2 Z=
85
Therefore MMM solution is :
1 2 3 4 5
1 5 5
2 1 2 10 13
3 3 3 6 12
10 3 4 6 7 30
Z=
85
VA Penalt
M 1 2 3 4 5 y
Numb
er
1 5 0
2 10 13 3 1
3 12 1
3 4 6 7 10
Penalt 1 2 1 0 5 30
y
Numb
er
VA
M 1 2 3 4
1 4 51 0
2 3 2
3 12 1
3 4 6 7
1 2 1 0 20
VA
M 1 3 4
1 1 1
2 3 3 3
3 12 2
3 6 47 16
1 1 0
VA
M 1 3 4
1 1 1 1
3 3 6 3 12 63 2
3 6 34 13 12 6 3
2 1 5
VAM solution is :
1 2 3 4 5
1 4 1 5
2 3 10 13
3 3 6 3 12
10 3 4 6 7 30
Z=
89
VAM solution (All Computations on one matrix)
1 2 3 4 5
1 4 1 5/1 [0,0,1,1]
2 3 10 13/3 [1,2,3]
3 3 6 3 12/6/3 [1,1,2,2]
3 4 6 7/4/3
10
[1,1,1,2] [2,2] [1,1,1,1] [0,0,0,5] [5]
30
Z=
89
 Optimality Test on
IBFS
Methods : 1. Stepping Stone
Method
2. MODI Method
MODI Method Of Checking
alityCondition To Be
Satis ed :
Filled Cells = m + n -
1Where m = No. of Rows
n = No. of
columns
 MODI Method for Optimality
Test
Get all ui & vj starting with any ui or vj as
zero,
such that ui + vj = cij in lled cells.
Get vacant cell Evaluation of all vacant
cells.
(VCE)ij = cij – (ui + vj)
MODI method to test Z = 89
optimality on VAM
solutions ui
+3 4 4 +4 3 1 +5 6 2
5 4
+4 +2 +6 53 1 2
3 -2 6 3 +1 7 7
5 0
vj -1 0 0 -1
-3
As (VCE)32 = -2, the solution under
test is not optimal.
For modi cation of existing ui
solution
44 : 31 6 2
5 4 53 1 2
3 -2 5 6 3 0 7 7
vj -1 0 0 -1
4 -3
1 1 4
- +
+ -
3 3
Hence, improved solution will be :
1 4
3 1
3 3 65 0

Z = 83
This solution is to be checked by MODI
Method for optimality.
Improved solution ui
: +1 4 1 + 3 4 + 6 -3
5
+ + 4 + 5 3 1
2 5 - 3
2 2 5 4
3 3 6 +2 +3 7 0 7 0
vj 6 5 5 4
4
As all vacant cell evaluations are
positive, the solution is optimal,
giving Z = 83.
MMM Solution
Z = 85
ui
4 2 03 5 2 6
-10 5 -3 4 5 2 2 1 1 -1
6
3 3 6 1 5 4 7 0 7 -1
vj 6 5 4 3 2 0
For modi cation of existing ui
solution
4 : 3 6
0 5
-10 5 -3 4 5 2 1 -1
3 3 61 5 0 7 -1
vj 6 5 4 3 2 0
5 1 4

1 2 3
Hence, improved solution will be :
1 4
3 1
3 3 6 5 0
Z = 85 – 2
Z = 83
This solution is to be checked by MODI
Method for optimality.
Improved solution ui
: 4 1 34 6 -3
5 4 53 1 -3
3 3 6 5 7 0 7 0
vj 6 5 5 4
4
As all vacant cell evaluations are
positive, the solution is optimal,
giving Z = 83.
For cases when closed gure is not
Equal or Rectangle :
1 - 3 4
+
7_ + 4 5
2
-
5 + 2 3
Degeneracy
Problem
The :
following table gives minimization transportation
problem with given allocation, check whether given solution
is optimal. If not, get the optimal solution.
X Y Z Supply
2 20 10 22
A 5 25
B 24 28 1 10 10
0
C 27 25 1 18
15
5
D 10 2 20 15 20
0
Deman 25 20 25
d
 2
25 0 ∈ 10 22 5
-1 24 2 10 10 10
8
-6 27 25 18
15 18
-2 10 2
2 0 ∈ 15 15
0 0
15 5 0
Z = 1270
25 ∈ 5 20

20 20
Hence, improved solution will
be :
 2
5 0 2 10 22
-3 25
24 0 2 10 10 10
8
27 25 15 18 18
2 10 2 15 15
0 0 ∈

-5 -15 0
Z = 1270 – (20 X 20) =
5 5 ∈

20 ∈ 20

Hence, improved solution will

be :
 Z = 870 – (3)∈() =
2
5 0 2 870
10 ∈ 22 22
24 0 2 10 10 10
8
27 25 15 18 18
2 10 2 15 12
0 0
-2 -12 0
Hence, this solution is
Problem :
12 82 -3 12 2 12
0 32 2 12 0
160 8 -20
3 16 25 32 13 4 0
0 5
16 32 4
Z=
7100
120 95 2
5
30 2 55
5
Hence, improved solution will
be :
 2
9 8 2 12 2 12
5 32 5 12 0
160 8
-8 12
5 16 32 13 4 0
5 5
16 0 4
Z = 7100 – (32) (25) =
95 25 120
95
160 65
55 135 150 40
Hence, improved solution will
 2 12 12 2 4
8 0 0
32 65 12 95 8 4
150 16 32 40 04
16 8 4
Z = 6300 – (8) (95) =
5540
Hence, this solution is Optimal.
Home
Assignments :
[ 1 ] Mr XYZ has suggested the following feasible
solution for a minimizing transportation problem as
given below. Check whether the solution is optimal. If
not, get optimal solution.
A B C D
1 10 2 20 15 11
2 12 7 9 20 15 10
3 3 14
5 16 18
[ 2 ] For following transportation (minimization)
problem, present total cost of transportation is Rs.
3100. Is it possible to reduce this by proper
scheduling ? What can be the saving ?
Centres
A B C Supply
Factories
X 253510 150
Y 20 5 80 100
Demand 50 50 150
[ 3 ] A manufacturer wants to ship 8 loads of his
product as shown in table below. The matrix gives
km from origin O to destination D. The shipping costs
are Rs. 10 per load per km. Find the optimal solution.
D1 D2 D3
O1 50 30 220 1
O2 90 45 170 3
O3 250 200 50 4
4 2 2
[ 4 ] Solve the following minimization Transportation
problem.
D1D2 D3 D4 Supply
O1 2 3 11 7 6
O2 1 1 6 1 1
O3 5 8 15 10 10
Demand 7 5 3 2
[ 5 ] In following transportation problem X, Y, Z
are warehouses and P, Q, R, S are customers. The
capacity at the warehouses and the demand from
customers are shown around the perimeter. Per
unit transportation costs are shown in the cells.
P Q R S
X7 8 11 10 30
Y 10 12 5 4 45
Z6 10 11 9 35
20 28 17 33
( i ) Find VAM solution. Is this solution optimal ? If
not, get optimal solution.
( ii ) By how much should YP cost need to be
[ 6 ] Using NWC rule method, get initial feasible
solution for following minimization transportation
problem. Is this solution optimal ? If not, get optimal
solution and corresponding optimal value of objective
function.
A B C Plant
capacity
W 4 8 8 55
X 16 24 16 25
Y 8 16 24 35
[ 7 ] A company has three plants at P1, P2, P3 which
supply to warehouses W1, W2, W3, W4 and W5. Monthly
plant capacities are 800, 500 and 900 units respectively.
Monthly warehouse requirements are 100, 400, 500,
400 and 800 units respectively. The unit transportation
costs in rupees are given in table below.
W1 W2 W3 W4 W5
P1 5 8 6 5 3
P24 7 7 3 6
P38 4 6 4 2
(i) Determine the optimal allocation for the
company.
( ii ) If the warehouse W1 is closed because of reduced
demand and the corresponding units are shipped to
[ 8 ] Find optimal solution of following maximization
Transportation problem. Is it a unique optimal
solution ? If not get alternative optimal solution.
A B C
X 4 4 9 25
Y 3 5 8 20
18 16 11
[ 9 ] Following is one of the feasible solution of
“Maximization Transportation Problem”. Show that it
is not optimal solution. Get optimal solution and
corresponding optimal value.
A B C
4 4 9
X 2 11
3 5 8
Y 16 5
[ 10 ] Three plants X, Y & Z produce 850, 730 & 820
refrigerators per week respectively. These are to
be distributed equally to six warehouses A, B, C, D,
E & F. The unit shipping cost matrix is given below.
Find optimal schedule and correspondent total cost.
A B C D E F
X 13 14 12 10 17 27
Y 12 20 17 14 33 13
Z 18 24 21 18 12 22
[ 11 ] A feasible solution of Minimization
Transportation Problem is given below.
( i ) Is it an optimal solution ? If not, get it.
( ii ) Is the optimal solution unique ? Justify.
D1 D2 D3
2 4 10
O1 7
5 6 3
O2 8 5
Transshipment
Problems :
 Transportation
Problem
D1 : D2
O1 7 3
3 3 6

O2 9 3 5 5

3 8
Z = 45
 Transshipment
OProblem
1 O 2 : D1 D2
O1 0 11 2 7 3 6 11 + 6
O2 2 0 11 9 3 5 11 + 5
D1 7 8 0 11 4 11
D2 2 2 2 3 0 8 11
11 11 11 + 3 11 + 8
Z = 39
 O1 O2
6 5
D1 D2
3
Home Assignments :
[1]
O1 O2 D1 D2
O1 0 1 3 4 5
O2 1 0 2 4 25
D1 3 2 0 1
D2 4 4 1 0
2 10
0
[2]
O1 O2 D1 D2
O1 0 2 2 1 8
O2 1 0 2 3 3
D1 2 2 0 2
D2 1 3 2 0
7 4
[3]
O1 O2 O3 O4 D1 D2
O1 4
0 20 5 25 12
O2
10 6 10 5
O3 0 20
10 7
O4 15 0 8 45
D1 10 6
20 25 0 30
D2 18 15 10
20 60 0
10 4