Transportation Methods PDF

3.
vogel's approximation method example ( Enter your problem )

Algorithm and examples Other related methods
1. Algorithm & Example-1 1. north-west corner method

2. Example-2 2. least cost method
3. Unbalanced supply and demand example 3. vogel's approximation method
4. Row minima method
5. Column minima method
6. Russell's approximation method
7. Heuristic method-1
9. modi method (optimal solution)
10. stepping stone method (optimal solution)
Variations in Transportation problem examples using m
1. Alternate optimal solutions example

2. Degeneracy at initial solution
3. Degeneracy at subsequent iterations
1. Algorithm & Example-1
Algorithm
Vogel's Approximation Method (VAM) or penalty method
This method is preferred over the NWCM and VAM, because the initial basic feasible solution obtained by this method is either opti
to the optimal solution.
Vogel's Approximation Method (VAM) Steps (Rule)
Step-1: Find the cells having smallest and next to smallest cost in each row and write the difference (called penalty) along the side
Step-2: Find the cells having smallest and next to smallest cost in each column and write the difference (called penalty) along the s
column penalty.
Step-3: Select the row or column with the maximum penalty and find cell that has least cost in selected row or column. Allocate as
cell.
If there is a tie in the values of penalties then select the cell where maximum allocation can be possible
Step-4: Adjust the supply & demand and cross out (strike out) the satisfied row or column.
Step-5: Repeact this steps until all supply and demand values are 0.
Example-1
1. Find Solution using Voggel's Approximation method
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4
Problem Table is
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
Table-1
D1 D2 D3 D4 Supply Row Penalty
S1 19 30 50 10 7 9 = 19 - 10
S2 70 30 40 60 9 10 = 40 - 30
S3 40 8 70 20 18 12 = 20 - 8
Demand 5 8 7 14
Column 21 = 40 - 19 22 = 30 - 8 10 = 50 - 40 10 = 20 - 10
Penalty
The maximum penalty, 22, occurs in column D 2.
The minimum c ij in this column is c 32 = 8.
The maximum allocation in this cell is min(18,8) = 8.

It satisfy demand of D 2 and adjust the supply of S 3 from 18 to 10 (18 - 8 = 10).
Table-2
S1 19 30 50 10 7 9 = 19 - 10
S2 70 30 40 60 9 20 = 60 - 40
S3 40 8(8) 70 20 10 20 = 40 - 20
Demand 5 0 7 14
Column 21 = 40 - 19 10 = 50 - 40 10 = 20 - 10
--
Penalty

Table-3
S1 19(5) 30 50 10 2 40 = 50 - 10
S2 70 30 40 60 9 20 = 60 - 40
S3 40 8(8) 70 20 10 50 = 70 - 20
Demand 0 0 7 14
Column
-- -- 10 = 50 - 40 10 = 20 - 10
Penalty
The maximum penalty, 50, occurs in row S 3.
The minimum c ij in this row is c 34 = 20.

It satisfy supply of S 3 and adjust the demand of D 4 from 14 to 4 (14 - 10 = 4).
Table-4
S1 19(5) 30 50 10 2 40 = 50 - 10
S2 70 30 40 60 9 20 = 60 - 40
S3 40 8(8) 70 20(10) 0 --
Demand 0 0 7 4
Column 10 = 50 - 40 50 = 60 - 10
-- --
Penalty

It satisfy supply of S 1 and adjust the demand of D 4 from 4 to 2 (4 - 2 = 2).
Table-5
-
S1 19(5) 30 50 10(2) 0 --
S2 70 30 40 60 9 20 = 60 - 40
S3 40 8(8) 70 20(10) 0 --
Demand 0 0 7 2
Column
-- -- 40 60
Penalty

Table-6
S1 19(5) 30 50 10(2) 0 --
S2 70 30 40 60(2) 7 40
S3 40 8(8) 70 20(10) 0 --
Demand 0 0 7 0
Column 40
-- -- --
Penalty
The maximum penalty, 40, occurs in row S 2.
The minimum c ij in this row is c 23 = 40.

It satisfy supply of S 2 and demand of D 3.
Initial feasible solution is

S1 19(5) 30 50 10(2) 7 9 | 9 | 40 | 40 | -- | -- |
S2 70 30 40(7) 60(2) 9 10 | 20 | 20 | 20 | 20 | 40 |
S3 40 8(8) 70 20(10) 18 12 | 20 | 50 | -- | -- | -- |
Demand 5 8 7 14
21 22 10 10
21 -- 10 10
Column -- -- 10 10
Penalty -- -- 10 50
-- -- 40 60
-- -- 40 --
The minimum total transportation cost = 19 × 5 + 10 × 2 + 40 × 7 + 60 × 2 + 8 × 8 + 20 × 10 = 779
Here, the number of allocated cells = 6 is equal to m + n - 1 = 3 + 4 - 1 = 6

∴ This solution is non-degenerate
4. row minima method example ( Enter your problem )


Algorithm
Row minima method Steps (Rule)
Step-1:
( )
In this method, we allocate as much as possible in the lowest cost cell of the first row, i.e. allocate min s i, d j .
Step-2: a. Subtract this min value from supply s i and demand d j.
b. If the supply s i is 0, then cross (strike) that row and If the demand d j is 0 then cross (strike) that column.
c. If min unit cost cell is not unique, then select the cell where maximum allocation can be possible
Step-3: Repeact this process for all uncrossed (unstriked) rows and columns until all supply and demand values are 0.
Example-1
1. Find Solution using Row minima method
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
Solution:
Problem Table is
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
In 1 st row, The smallest transportation cost is 10 in cell S 1D 4.

The allocation to this cell is min(7,14) = 7.
This exhausts the capacity of S 1 and leaves 14 - 7 = 7 units with D 4
Table-1
D1 D2 D3 D4 Supply
S1 19 30 50 10(7) 0
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 7
In 2 nd row, The smallest transportation cost is 30 in cell S 2D 2.

This satisfies the entire demand of D 2 and leaves 9 - 8 = 1 units with S 2
Table-2
D1 D2 D3 D4 Supply
S1 19 30 50 10(7) 0
S2 70 30(8) 40 60 1
S3 40 8 70 20 18
Demand 5 0 7 7

Table-3
D1 D2 D3 D4 Supply
S1 19 30 50 10(7) 0
S2 70 30(8) 40(1) 60 0
S3 40 8 70 20 18
Demand 5 0 6 7
In 3 rd row, The smallest transportation cost is 20 in cell S 3D 4.

Table-4
D1 D2 D3 D4 Supply
S1 19 30 50 10(7) 0
S2 70 30(8) 40(1) 60 0
S3 40 8 70 20(7) 11
Demand 5 0 6 0

Table-5
D1 D2 D3 D4 Supply
S1 19 30 50 10(7) 0
S2 70 30(8) 40(1) 60 0
S3 40(5) 8 70 20(7) 6
Demand 0 0 6 0

Table-6
D1 D2 D3 D4 Supply
S1 19 30 50 10(7) 0
S2 70 30(8) 40(1) 60 0
S3 40(5) 8 70(6) 20(7) 0
Demand 0 0 0 0

D1 D2 D3 D4 Supply
S1 19 30 50 10 (7) 7
S2 70 30 (8) 40 (1) 60 9
S3 40 (5) 8 70 (6) 20 (7) 18
Demand 5 8 7 14

4. row minima method example ( Enter your problem )


3. Unbalanced supply and demand example
Unbalanced supply and demand

If the total supply is not equal to the total demand then the problem is called unbalanced transportation problem.
It's solution :
1. If the total supply is more than the total demand, then we add a new column, with transportation cost 0
2. If the total demand is more than the total supply, then we add a new row, with transportation cost 0
Example
Find Solution using Row minima method
D1 D2 D3 Supply
S1 4 8 8 76
S2 16 24 16 82
S3 8 16 24 77
Demand 72 102 41
Solution:
Problem Table is
D1 D2 D3 Supply
S1 4 8 8 76
S2 16 24 16 82
S3 8 16 24 77
Demand 72 102 41
Here Total Demand = 215 is less than Total Supply = 235. So We add a dummy demand constraint with 0 unit cost and with allocation 20.
Now, The modified table is
D1 D2 D 3 D dummy Supply
S1 4 8 8 0 76
S2 16 24 16 0 82
S3 8 16 24 0 77
Demand 72 102 41 20
In 1 st row, The smallest transportation cost is 0 in cell S 1D dummy.

This satisfies the entire demand of D dummy and leaves 76 - 20 = 56 units with S 1
Table-1
S1 4 8 8 0(20) 56
S2 16 24 16 0 82
S3 8 16 24 0 77
Demand 72 102 41 0
In 1 st row, The smallest transportation cost is 4 in cell S 1D 1.

Table-2
S1 4(56) 8 8 0(20) 0
S2 16 24 16 0 82
S3 8 16 24 0 77
Demand 16 102 41 0

Table-3
D1 D2 D3 D dummy Supply
S1 4(56) 8 8 0(20) 0
S2 16 24 16(41) 0 41
S3 8 16 24 0 77
Demand 16 102 0 0

Table-4
S1 4(56) 8 8 0(20) 0
S2 16(16) 24 16(41) 0 25
S3 8 16 24 0 77
Demand 0 102 0 0

Table-5
S1 4(56) 8 8 0(20) 0
S2 16(16) 24(25) 16(41) 0 0
S3 8 16 24 0 77
Demand 0 77 0 0

Table-6
Supply
D1 D2 D3 D dummy
S1 4(56) 8 8 0(20) 0
S2 16(16) 24(25) 16(41) 0 0
S3 8 16(77) 24 0 0
Demand 0 0 0 0

S1 4 (56) 8 8 0 (20) 76
S2 16 (16) 24 (25) 16 (41) 0 82
S3 8 16 (77) 24 0 77
Demand 72 102 41 20

5. column minima method example ( Enter your problem )


Algorithm
Column minima method Steps (Rule)
Step-1:
( )
In this method, we allocate as much as possible in the lowest cost cell of the first Column, i.e. allocate min s i, d j .
Step-2: a. Subtract this min value from supply s i and demand d j.
b. If the supply s i is 0, then cross (strike) that row and If the demand d j is 0 then cross (strike) that column.
c. If min unit cost cell is not unique, then select the cell where maximum allocation can be possible
Step-3: Repeact this process for all uncrossed (unstriked) rows and columns until all supply and demand values are 0.
Example-1
1. Find Solution using Column minima method
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
Solution:
Problem Table is
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
In 1 st column, The smallest transportation cost is 19 in cell S 1D 1

Table-1
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10 2
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 0 8 7 14
In 2 nd column, The smallest transportation cost is 8 in cell S 3D 2

Table-2
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10 2
S2 70 30 40 60 9
S3 40 8(8) 70 20 10
Demand 0 0 7 14
In 3 rd column, The smallest transportation cost is 40 in cell S 2D 3

Table-3
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10 2
S2 70 30 40(7) 60 2
S3 40 8(8) 70 20 10
Demand 0 0 0 14
In 4 th column, The smallest transportation cost is 10 in cell S 1D 4

Table-4
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10(2) 0
S2 70 30 40(7) 60 2
S3 40 8(8) 70 20 10
Demand 0 0 0 12

Table-5
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10(2) 0
S2 70 30 40(7) 60 2
S3 40 8(8) 70 20(10) 0
Demand 0 0 0 2

Table-6
D1 D2 D3 D4 Supply
S1 19(5) 30 50 10(2) 0
S2 70 30 40(7) 60(2) 0
S3 40 8(8) 70 20(10) 0
Demand 0 0 0 0

D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 (2) 7
S2 70 30 40 (7) 60 (2) 9
S3 40 8 (8) 70 20 (10) 18
Demand 5 8 7 14

6. russell's approximation method example ( Enter your problem )


1 3. Degeneracy at subsequent iterations
Algorithm
Russell's Approximation Method (RAM):
Step-1: For each source row still under consideration, determine its U
ˉ (largest cost in row i).
i
Step-2: For each destination column still under consideration, determine its Vˉ (largest cost in column j).
j
Step-3:
(
For each variable, calculate Δ ij = c ij - U i )
ˉ + Vˉ .
j
Step-4: Select the variable having the most negative Δ value, break ties arbitrarily.
Step-5: Allocate as much as possible. Eliminate necessary cells from consideration. Return to Step-1.
Example-1
1. Find Solution using Russell's Approximation method
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
Solution:
Problem Table is
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14
ˉ and Vˉ (where U
Table-1: Calculate U ˉ
i j i
D1 D2 D3 D4 ˉi
Supply U
S1 19 30 50 10 7 50
S2 70 30 40 60 9 70
S3 40 8 70 20 18 70
Demand 5 8 7 14
Vˉ j 70 30 70 60
ˉ + Vˉ
2. Compute reduced cost of each cell Δ ij, where Δ ij = c ij - U i j ( )
(
1. Δ 11 = c 11 - U 1 1 )
ˉ + Vˉ = 19 - (50 + 70) = - 101
(
2. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 30 - (50 + 30) = - 50
(
3. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 50 - (50 + 70) = - 70
(
4. Δ 14 = c 14 - U 1 4 )
ˉ + Vˉ = 10 - (50 + 60) = - 100
(
5. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 70 - (70 + 70) = - 70
(
6. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 30 - (70 + 30) = - 70
(
7. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 40 - (70 + 70) = - 100
(
8. Δ 24 = c 24 - U 2 4 )
ˉ + Vˉ = 60 - (70 + 60) = - 70
(
9. Δ 31 = c 31 - U 3 1 )
ˉ + Vˉ = 40 - (70 + 70) = - 100
(
10. Δ 32 = c 32 - U 3 2 )
ˉ + Vˉ = 8 - (70 + 30) = - 92
(
11. Δ 33 = c 33 - U 3 3 )
ˉ + Vˉ = 70 - (70 + 70) = - 70
(
12. Δ 34 = c 34 - U 3 4 )
ˉ + Vˉ = 20 - (70 + 60) = - 110
D1 D2 D3 D4 ˉi
Supply U
S1 19 [-101] 30 [-50] 50 [-70] 10 [-100] 7 50
S2 70 [-70] 30 [-70] 40 [-100] 60 [-70] 9 70
S3 40 [-100] 8 [-92] 70 [-70] 20 [-110] 18 70
Demand 5 8 7 14
Vˉ j 70 30 70 60
The most negative Δ ij is -110 in cell S 3D 4

Table-1: This leads to the following table

D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 (14) 4
Demand 5 8 7 0
ˉ i and Vˉ j (where U
Table-2: Calculate U ˉ i is the largest cost in row and Vˉ j is the largest cost in column)
D1 D2 D3 D4 ˉ
Supply U i
S1 19 30 50 10 7 50
S2 70 30 40 60 9 70
S3 40 8 70 20(14) 4 70
Demand 5 8 7 0
Vˉ j 70 30 70 --
ˉ + Vˉ
(
1. Δ 11 = c 11 - U 1 1 )
ˉ + Vˉ = 19 - (50 + 70) = - 101
(
2. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 30 - (50 + 30) = - 50
(
3. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 50 - (50 + 70) = - 70
(
4. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 70 - (70 + 70) = - 70
(
5. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 30 - (70 + 30) = - 70
(
6. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 40 - (70 + 70) = - 100
(
7. Δ 31 = c 31 - U 3 1 )
ˉ + Vˉ = 40 - (70 + 70) = - 100
(
8. Δ 32 = c 32 - U 3 2 )
ˉ + Vˉ = 8 - (70 + 30) = - 92
(
9. Δ 33 = c 33 - U 3 3 )
ˉ + Vˉ = 70 - (70 + 70) = - 70
D1 D2 D3 D4 ˉ
Supply U i
S1 19 [-101] 30 [-50] 50 [-70] 10 7 50
S2 70 [-70] 30 [-70] 40 [-100] 60 9 70
S3 40 [-100] 8 [-92] 70 [-70] 20(14) 4 70
Demand 5 8 7 0
Vˉ j 70 30 70 --


D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 2
S2 70 30 40 60 9
S3 40 8 70 20 (14) 4
Demand 0 8 7 0
ˉ and Vˉ (where U
Table-3: Calculate U ˉ is the largest cost in row and Vˉ is the largest cost in column)
i j i j
D1 D2 D3 D4 ˉi
Supply U
S1 19(5) 30 50 10 2 50
S2 70 30 40 60 9 40
S3 40 8 70 20(14) 4 70
Demand 0 8 7 0
Vˉ j -- 30 70 --
ˉ + Vˉ
(
1. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 30 - (50 + 30) = - 50
(
2. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 50 - (50 + 70) = - 70
(
3. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 30 - (40 + 30) = - 40
(
4. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 40 - (40 + 70) = - 70
(
5. Δ 32 = c 32 - U 3 2 )
ˉ + Vˉ = 8 - (70 + 30) = - 92
(
6. Δ 33 = c 33 - U 3 3 )
ˉ + Vˉ = 70 - (70 + 70) = - 70
D1 D2 D3 D4 ˉ
Supply U i
S1 19(5) 30 [-50] 50 [-70] 10 2 50
S2 70 30 [-40] 40 [-70] 60 9 40
S3 40 8 [-92] 70 [-70] 20(14) 4 70
Demand 0 8 7 0
Vˉ j -- 30 70 --


D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 2
S2 70 30 40 60 9
S3 40 8 (4) 70 20 (14) 0
Demand 0 4 7 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉi
Supply U
S1 19(5) 30 50 10 2 50
S2 70 30 40 60 9 40
S3 40 8(4) 70 20(14) 0 --
Demand 0 4 7 0
Vˉ j -- 30 50 --
ˉ + Vˉ
(
1. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 30 - (50 + 30) = - 50
(
2. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 50 - (50 + 50) = - 50
(
3. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 30 - (40 + 30) = - 40
(
4. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 40 - (40 + 50) = - 50
D1 D2 D3 D4 ˉi
Supply U
S1 19(5) 30 [-50] 50 [-50] 10 2 50
S2 70 30 [-40] 40 [-50] 60 9 40
S3 40 8(4) 70 20(14) 0 --
Demand 0 4 7 0
Vˉ j -- 30 50 --


D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 2
S2 70 30 40 (7) 60 2
S3 40 8 (4) 70 20 (14) 0
Demand 0 4 0 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉ
Supply U i
S1 19(5) 30 50 10 2 30
S2 70 30 40(7) 60 2 30
S3 40 8(4) 70 20(14) 0 --
Demand 0 4 0 0
Vˉ j -- 30 -- --
ˉ + Vˉ
(
1. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 30 - (30 + 30) = - 30
(
2. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 30 - (30 + 30) = - 30
D1 D2 D3 D4 ˉ
Supply U i
S1 19(5) 30 [-30] 50 10 2 30
S2 70 30 [-30] 40(7) 60 2 30
S3 40 8(4) 70 20(14) 0 --
Demand 0 4 0 0
Vˉ j -- 30 -- --


D1 D2 D3 D4 Supply
S1 19 (5) 30 (2) 50 10 0
S2 70 30 40 (7) 60 2
S3 40 8 (4) 70 20 (14) 0
Demand 0 2 0 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉ
Supply U i
S1 19(5) 30(2) 50 10 0 --
S2 70 30 40(7) 60 2 30
S3 40 8(4) 70 20(14) 0 --
Demand 0 2 0 0
Vˉ j -- 30 -- --
ˉ i + Vˉ j
2. Compute reduced cost of each cell Δ ij, where Δ ij = c ij - U ( )
( )
ˉ 2 + Vˉ 2 = 30 - (30 + 30) = - 30
1. Δ 22 = c 22 - U
D1 D2 D3 D4 ˉ
Supply U i
S1 19(5) 30(2) 50 10 0 --
S2 70 30 [-30] 40(7) 60 2 30
S3 40 8(4) 70 20(14) 0 --
Demand 0 2 0 0
Vˉ j -- 30 -- --

D1 D2 D3 D4 Supply
S1 19 (5) 30 (2) 50 10 0
S2 70 30 (2) 40 (7) 60 0
S3 40 8 (4) 70 20 (14) 0
Demand 0 0 0 0

D1 D2 D3 D4 Supply
S1 19 (5) 30 (2) 50 10 7
S2 70 30 (2) 40 (7) 60 9
S3 40 8 (4) 70 20 (14) 18
Demand 5 8 7 14

6. russell's approximation method example ( Enter your problem )


2. Example-2
Find Solution using Russell's Approximation method

D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250
Solution:
Problem Table is
D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉi
Supply U
S1 11 13 17 14 250 17
S2 16 18 14 10 300 18
S3 21 24 13 10 400 24
Demand 200 225 275 250
Vˉ j 21 24 17 14
ˉ + Vˉ
(
1. Δ 11 = c 11 - U 1 1 )
ˉ + Vˉ = 11 - (17 + 21) = - 27
(
2. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 13 - (17 + 24) = - 28
(
3. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 17 - (17 + 17) = - 17
(
4. Δ 14 = c 14 - U 1 4 )
ˉ + Vˉ = 14 - (17 + 14) = - 17
(
5. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 16 - (18 + 21) = - 23
(
6. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 18 - (18 + 24) = - 24
(
7. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 14 - (18 + 17) = - 21
(
8. Δ 24 = c 24 - U 2 4 )
ˉ + Vˉ = 10 - (18 + 14) = - 22
(
9. Δ 31 = c 31 - U 3 1 )
ˉ + Vˉ = 21 - (24 + 21) = - 24
(
10. Δ 32 = c 32 - U 3 2 )
ˉ + Vˉ = 24 - (24 + 24) = - 24
(
11. Δ 33 = c 33 - U 3 3 )
ˉ + Vˉ = 13 - (24 + 17) = - 28
(
12. Δ 34 = c 34 - U 3 4 )
ˉ + Vˉ = 10 - (24 + 14) = - 28
D1 D2 D3 D4 ˉ
Supply U i
S1 11 [-27] 13 [-28] 17 [-17] 14 [-17] 250 17
S2 16 [-23] 18 [-24] 14 [-21] 10 [-22] 300 18
S3 21 [-24] 24 [-24] 13 [-28] 10 [-28] 400 24
Demand 200 225 275 250
Vˉ j 21 24 17 14


D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 (250) 150
Demand 200 225 275 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉi
Supply U
S1 11 13 17 14 250 17
S2 16 18 14 10 300 18
S3 21 24 13 10(250) 150 24
Demand 200 225 275 0
Vˉ j 21 24 17 --
ˉ + Vˉ
(
1. Δ 11 = c 11 - U 1 1 )
ˉ + Vˉ = 11 - (17 + 21) = - 27
(
2. Δ 12 = c 12 - U 1 2 )
ˉ + Vˉ = 13 - (17 + 24) = - 28
(
3. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 17 - (17 + 17) = - 17
(
4. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 16 - (18 + 21) = - 23
(
5. Δ 22 = c 22 - U 2 2 )
ˉ + Vˉ = 18 - (18 + 24) = - 24
(
6. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 14 - (18 + 17) = - 21
(
7. Δ 31 = c 31 - U 3 1 )
ˉ + Vˉ = 21 - (24 + 21) = - 24
(
8. Δ 32 = c 32 - U 3 2 )
ˉ + Vˉ = 24 - (24 + 24) = - 24
(
9. Δ 33 = c 33 - U 3 3 )
ˉ + Vˉ = 13 - (24 + 17) = - 28
D1 D2 D3 D4 ˉ
Supply U i
S1 11 [-27] 13 [-28] 17 [-17] 14 250 17
S2 16 [-23] 18 [-24] 14 [-21] 10 300 18
S3 21 [-24] 24 [-24] 13 [-28] 10(250) 150 24
Demand 200 225 275 0
Vˉ j 21 24 17 --


D1 D2 D3 D4 Supply
S1 11 13 (225) 17 14 25
S2 16 18 14 10 300
S3 21 24 13 10 (250) 150
Demand 200 0 275 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉi
Supply U
S1 11 13(225) 17 14 25 17
S2 16 18 14 10 300 16
S3 21 24 13 10(250) 150 21
Demand 200 0 275 0
Vˉ j 21 -- 17 --
ˉ + Vˉ
(
1. Δ 11 = c 11 - U 1 1 )
ˉ + Vˉ = 11 - (17 + 21) = - 27
(
2. Δ 13 = c 13 - U 1 3 )
ˉ + Vˉ = 17 - (17 + 17) = - 17
(
3. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 16 - (16 + 21) = - 21
(
4. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 14 - (16 + 17) = - 19
(
5. Δ 31 = c 31 - U 3 1 )
ˉ + Vˉ = 21 - (21 + 21) = - 21
(
6. Δ 33 = c 33 - U 3 3 )
ˉ + Vˉ = 13 - (21 + 17) = - 25
D1 D2 D3 D4 ˉi
Supply U
S1 11 [-27] 13(225) 17 [-17] 14 25 17
S2 16 [-21] 18 14 [-19] 10 300 16
S3 21 [-21] 24 13 [-25] 10(250) 150 21
Demand 200 0 275 0
Vˉ j 21 -- 17 --


D1 D2 D3 D4 Supply
S1 11 (25) 13 (225) 17 14 0
S2 16 18 14 10 300
S3 21 24 13 10 (250) 150
Demand 175 0 275 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉ
Supply U i
S1 11(25) 13(225) 17 14 0 --
S2 16 18 14 10 300 16
S3 21 24 13 10(250) 150 21
Demand 175 0 275 0
Vˉ j 21 -- 14 --
ˉ + Vˉ
(
1. Δ 21 = c 21 - U 2 1)
ˉ + Vˉ = 16 - (16 + 21) = - 21
(
2. Δ 23 = c 23 - U 2 3)
ˉ + Vˉ = 14 - (16 + 14) = - 16
(
3. Δ 31 = c 31 - U 3 1)
ˉ + Vˉ = 21 - (21 + 21) = - 21
(
4. Δ 33 = c 33 - U 3 3)
ˉ + Vˉ = 13 - (21 + 14) = - 22
D1 D2 D3 D4 ˉi
Supply U
S1 11(25) 13(225) 17 14 0 --
S2 16 [-21] 18 14 [-16] 10 300 16
S3 21 [-21] 24 13 [-22] 10(250) 150 21
Demand 175 0 275 0
Vˉ j 21 -- 14 --


D1 D2 D3 D4 Supply
S1 11 (25) 13 (225) 17 14 0
S2 16 18 14 10 300
S3 21 24 13 (150) 10 (250) 0
Demand 175 0 125 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉ
Supply U i
S1 11(25) 13(225) 17 14 0 --
S2 16 18 14 10 300 16
S3 21 24 13(150) 10(250) 0 --
Demand 175 0 125 0
Vˉ j 16 -- 14 --
ˉ + Vˉ
(
1. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 16 - (16 + 16) = - 16
(
2. Δ 23 = c 23 - U 2 3 )
ˉ + Vˉ = 14 - (16 + 14) = - 16
D1 D2 D3 D4 ˉ
Supply U i
S1 11(25) 13(225) 17 14 0 --
S2 16 [-16] 18 14 [-16] 10 300 16
S3 21 24 13(150) 10(250) 0 --
Demand 175 0 125 0
Vˉ j 16 -- 14 --


D1 D2 D3 D4 Supply
S1 11 (25) 13 (225) 17 14 0
S2 16 18 14 (125) 10 175
S3 21 24 13 (150) 10 (250) 0
Demand 175 0 0 0
ˉ and Vˉ (where U
i j i j
D1 D2 D3 D4 ˉi
Supply U
S1 11(25) 13(225) 17 14 0 --
S2 16 18 14(125) 10 175 16
S3 21 24 13(150) 10(250) 0 --
Demand 175 0 0 0
Vˉ j 16 -- -- --
ˉ + Vˉ
(
1. Δ 21 = c 21 - U 2 1 )
ˉ + Vˉ = 16 - (16 + 16) = - 16
D1 D2 D3 D4 ˉi
Supply U
S1 11(25) 13(225) 17 14 0 --
S2 16 [-16] 18 14(125) 10 175 16
S3 21 24 13(150) 10(250) 0 --
Demand 175 0 0 0
Vˉ j 16 -- -- --

D1 D2 D3 D4 Supply
S1 11 (25) 13 (225) 17 14 0
S2 16 (175) 18 14 (125) 10 0
S3 21 24 13 (150) 10 (250) 0
Demand 0 0 0 0

D1 D2 D3 D4 Supply
S1 11 (25) 13 (225) 17 14 250

S2 16 (175) 18 14 (125) 10 300
S3 21 24 13 (150) 10 (250) 400
Demand 200 225 275 250


Transportation Methods PDF

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Transportation Methods PDF

Încărcat de

Drepturi de autor:

Formate disponibile

3.

vogel's approximation method example ( Enter your problem )

1. Algorithm & Example-1 1. north-west corner method

Variations in Transportation problem examples using m

1. Alternate optimal solutions example

1. Algorithm & Example-1

The maximum penalty, 22, occurs in column D 2.

The minimum c ij in this column is c 32 = 8.

The maximum allocation in this cell is min(18,8) = 8.

The maximum penalty, 21, occurs in column D 1.

The minimum c ij in this column is c 11 = 19.

The maximum allocation in this cell is min(7,5) = 5.

The maximum penalty, 50, occurs in row S 3.

The minimum c ij in this row is c 34 = 20.

The maximum allocation in this cell is min(10,14) = 10.

The maximum penalty, 50, occurs in column D 4.

The minimum c ij in this column is c 14 = 10.

The maximum allocation in this cell is min(2,4) = 2.

The maximum penalty, 60, occurs in column D 4.

The minimum c ij in this column is c 24 = 60.

The maximum allocation in this cell is min(9,2) = 2.

The maximum penalty, 40, occurs in row S 2.

The minimum c ij in this row is c 23 = 40.

The maximum allocation in this cell is min(7,7) = 7.

Initial feasible solution is

The minimum total transportation cost = 19 × 5 + 10 × 2 + 40 × 7 + 60 × 2 + 8 × 8 + 20 × 10 = 779

Here, the number of allocated cells = 6 is equal to m + n - 1 = 3 + 4 - 1 = 6

1. Algorithm & Example-1 1. north-west corner method

Variations in Transportation problem examples using m

1. Alternate optimal solutions example

1. Algorithm & Example-1

Step-2: a. Subtract this min value from supply s i and demand d j.

In 1 st row, The smallest transportation cost is 10 in cell S 1D 4.

In 2 nd row, The smallest transportation cost is 30 in cell S 2D 2.

The allocation to this cell is min(9,8) = 8.

In 2 nd row, The smallest transportation cost is 40 in cell S 2D 3.

The allocation to this cell is min(1,7) = 1.

In 3 rd row, The smallest transportation cost is 20 in cell S 3D 4.

The allocation to this cell is min(18,7) = 7.

In 3 rd row, The smallest transportation cost is 40 in cell S 3D 1.

The allocation to this cell is min(11,5) = 5.

In 3 rd row, The smallest transportation cost is 70 in cell S 3D 3.

The allocation to this cell is min(6,6) = 6.

Initial feasible solution is

S3 40 (5) 8 70 (6) 20 (7) 18

The minimum total transportation cost = 10 × 7 + 30 × 8 + 40 × 1 + 40 × 5 + 70 × 6 + 20 × 7 = 1110

Here, the number of allocated cells = 6 is equal to m + n - 1 = 3 + 4 - 1 = 6

1. Algorithm & Example-1 1. north-west corner method

Variations in Transportation problem examples using m

1. Alternate optimal solutions example

3. Unbalanced supply and demand example

Unbalanced supply and demand

In 1 st row, The smallest transportation cost is 0 in cell S 1D dummy.

The allocation to this cell is min(76,20) = 20.

In 1 st row, The smallest transportation cost is 4 in cell S 1D 1.

The allocation to this cell is min(56,72) = 56.

In 2 nd row, The smallest transportation cost is 16 in cell S 2D 3.

The allocation to this cell is min(82,41) = 41.

In 2 nd row, The smallest transportation cost is 16 in cell S 2D 1.

The allocation to this cell is min(41,16) = 16.

In 2 nd row, The smallest transportation cost is 24 in cell S 2D 2.

The allocation to this cell is min(25,102) = 25.