Scribd
Upload
58 views4 pages

Transportation Problem

Transportation tble

Uploaded by

hsurampudi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
58 views4 pages

Transportation Problem

Transportation tble

Uploaded by

hsurampudi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Transportation problem - Complete solution First step:Warehouse A Factory 1 2 3 4 B C 7 8 A 16 4 120 (x ) 1 12 8 80 4 4 D 1 8 B 5 7 160 (x) 3 4 (90) 10 90 4 x Supply Row penalty (tonnes)

(iteration 1) 100 200 C 150 D 3 5 3 Second step:Supply Row (tonnes) penalty (iteration 2) (iteration 1) 100 3 3 200 150 450 450 1 1 4 4 5 3 0 3

Demand (tonnes) 24 Column penalty (iteration 1) 3

7 (x) 12 3 Warehouse (90) 8 10 Factory ( x ) 1 80 90 4

7 1 450 ( 450 (100) x) 8 8 16 120 5 160

Note:- when there are two fours, we have to consider that 4 which contains the least unit transportation cost in the column. Hence consider column D and not column A.

Demand (tonnes) Column penalty (iteration 1) (iteration 2)

Third step:-

Warehouse Factory 1 2 3 Demand (tonnes) Column penalty iteration 1 Iteration 2 Iteration 3 Final step:Warehouse Factory 1 2 3

Supply Row penalty (tonnes) (iteration 1) 3 5 3 450 450

(iteration 2) 3 0 3

(iteration 3)

4 (x) 12 (x) 8 80 4 4 4

7 (x) 3 (90) 10 (x) 90 4 x x

7 (x) 8 (110 ) 16 120 1 1 8

1 100 (100) 8 200 (x) 5 160 4 4 3 150

x 0 3

Supply Row penalty (tonnes) (iteration 1) 3 5 3

(iteration 2)

(iteration 3)

4 (x) 12 (x)

7 (x) 3 (90)

Demand (tonnes) Column 4 penalty (iteration 1) (teration 2 4 (iteration 3) 4

8 10 (80) (x) 80 90 4 x x

7 (x) 8 (110 ) 16 (10) 120 1 1 8

1 100 (100) 8 200 (x) 5 (60) 160 4 4 3 150 450

3 0 3

x 0 3

Proving optimality by stepping stone method:-

Warehouse Factory 1 2 3

Supply Row penalty (tonnes) (iteration 1) 3 5 3

(iteration 2)

(iteration 3)

4 (x) 12 (x)

7 (x) 3 (90)

Demand (tonnes) Column 4 penalty (iteration 1) (teration 2 4 (iteration 3) 4

8 10 (80) (x) 80 90 4 x x

7 (x) 8 (110 ) 16 (10) 120 1 1 8

1 100 (100) 8 200 (x) 5 (60) 160 4 4 3 150 450

3 0 3

x 0 3

Closed path for 1A:- + 4 1 + 5 8 = 0 (ok) 1B:- +7 1 + 5 16 + 8 3 = 0 (ok) 1C:- +7 1 + 5 16 = -5 (not ok) 2A:- +12 8 + 16 8 = +12 (ok) 2D:- + 8 -5 + 16 -8 = +11 (ok) 3B:- +10 -3 +8 -16 = -1 (not ok) There are two minus paths out of which minus path 1C is worse than minus path 3B. Hence we have to reallocate in minus path 1C as follows:allocate 10 to cell 1C (earlier it was zero) make cell 1D as 90 (instead of 100) make cell 3D as 70 (instead of 60) remove 10 from cell 3C (earlier it was 10)

The revised allocations will look as follows:Warehouse Factory 1 2 3 4 (x) 12 (x) 7 (x) 3 (90) 7 (10) 8 (110 ) 16 (x) 120 1 1 8 1 (90) 8 (x) 5 (70) 160 4 4 3 100 200 150 450 3 5 3 3 0 3 x 0 3 A B C D Supply Row penalty (tonnes) (iteration 1) (iteration 2) (iteration 3)

Demand (tonnes) Column 4 penalty (iteration 1) (iteration 2 4 (iteration 3) 4

8 10 (80) (x) 80 90 4 x x

Again after reallocation verify the closed paths of unallocated cells:Closed path for 1A:- +4 -1 +5 -8 = 0 (ok) 1B:- +7 -1 +5 -10 = +1 (ok) 2A:- +12 -8 +7 -1 +5 -8 = +7 (ok) 2D:- +8 -8 +7 -1 = +6 (ok) 3B:- +10 -3 +8 -7 +1 -5 = +4 (ok) 3C:- +16 -7 +1 -5 = +5 (ok) Now all the closed paths are either positive or zero. Hence this is the optimal allocation. The total minimum cost will be :10x7 + 90x1 + 90x3 + 110x8 + 80x8 + 70x5 = $2,300 Closed path 1A being zero indicates that more than one optimal solution is possible by alternate allocations in that path.

You might also like