Download - transportation problem
![Page 1: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/1.jpg)
1
Transportation Problems
• Transportation is considered as a “special case” of LP
• Reasons?– it can be formulated using LP technique so is
its solution
(to p2)
![Page 2: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/2.jpg)
2
• Here, we attempt to firstly define what are them and then studying their solution methods: (to p3)
![Page 3: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/3.jpg)
3
Transportation Problem
• We have seen a sample of transportation problem on slide 29 in lecture 2
• Here, we study its alternative solution method
• Consider the following transportation tableau (to p6)
(to p4)
![Page 4: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/4.jpg)
4
Review of Transportation Problem
Warehouse supply of televisions sets: Retail store demand for television sets:
1- Cincinnati 300 A - New York 150
2- Atlanta 200 B - Dallas 250
3- Pittsburgh 200 C - Detroit 200
total 700 total 600
To StoreFromWarehouse
A B C
1 $16 $18 $11
2 14 12 13
3 13 15 17
LP formulation (to p5)
![Page 5: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/5.jpg)
5
A Transportation Example (2 of 3) Model Summary and Computer Solution with Excel
Minimize Z = $16x1A + 18x1B + 11x1C + 14x2A + 12x2B + 13x2C + 13x3A + 15x3B + 17x3C
subject to
x1A + x1B+ x1 300
x2A+ x2B + x2C 200
x3A+ x3B + x3C 200
x1A + x2A + x3A = 150
x1B + x2B + x3B = 250
x1C + x2C + x3C = 200
xij 0
Exhibit 4.15(to p3)
![Page 6: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/6.jpg)
6
Transportation Tableau
• We know how to formulate it using LP technique– Refer to lecture 2 note
• Here, we study its solution by firstly attempting to determine its initial tableau– Just like the first simplex tableau!
(to p7)
![Page 7: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/7.jpg)
7
Solution to a transportation problem
• Initial tableau
• Optimal solution
• Important Notes
• Tutorials
(to p8)
(to p43)
(to p23)
(to p53)
![Page 8: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/8.jpg)
8
initial tableau
• Three different ways:– Northwest corner method– The Minimum cell cost method– Vogel’s approximation method (VAM)
• Now, are these initial tableaus given us an
Optimal solution?
(to p9)
(to p12)
(to p16)
(to p7)
![Page 9: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/9.jpg)
9
Northwest corner method
Steps:1. assign largest possible allocation to the cell
in the upper left-hand corner of the tableau
2. Repeat step 1 until all allocations have been assigned
3. Stop. Initial tableau is obtained
Example(to p10)
![Page 10: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/10.jpg)
10
Northeast corner
150
Step 1
Max (150,200)
Step 2
150
50
-- -- 0
150
--
--
-- 0
0
125
(to p11)
![Page 11: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/11.jpg)
11
Initial tableau of NW corner method
• Repeat the above steps, we have the following tableau.
• Stop. Since all allocated have been assigned
Ensure that all columns and rows added up to its respective totals.(to p8)
![Page 12: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/12.jpg)
12
The Minimum cell cost method
Here, we use the following steps:
Steps:Step 1 Find the cell that has the least cost
Step 2: Assign as much as allocation to this cell
Step 3: Block those cells that cannot be allocated
Step 4: Repeat above steps until all allocation have been assigned.
Example: (to p13)
![Page 13: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/13.jpg)
13
Step 1 Find the cell that has the least costStep 2: Assign as much as allocation to this cell
Step 1:
The min cost, so allocate as much resource as possible here
200
Step 3
Step 2:
(to p14)
![Page 14: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/14.jpg)
14
Step 3: Block those cells that cannot be allocatedStep 4: Repeat above steps until all allocation have been assigned.
Step 3:
200
--
--
0
75
Second iteration, step 4
(to p15)
![Page 15: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/15.jpg)
15
The initial solution
• Stop. The above tableau is an initial tableau because all allocations have been assigned
(to p8)
![Page 16: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/16.jpg)
16
Vogel’s approximation method
Operational steps:Step 1: for each column and row, determine its penalty cost by subtracting their two of their
least cost Step 2: select row/column that has the highest penalty cost
in step 1Step 3: assign as much as allocation to the
selected row/column that has the least costStep 4: Block those cells that cannot be further allocatedStep 5: Repeat above steps until all allocations have been
assigned
Example(to p17)
![Page 17: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/17.jpg)
17
subtracting their two of their least cost
Step 1
(8-6)
(11-7)
(5-4)
(6-4) (8-5) (11-10)(to p18)
![Page 18: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/18.jpg)
18
Steps 2 & 3
Highest penaltycost
Step 2:
Step 3: this has the least cost
(to p19)
![Page 19: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/19.jpg)
19
Step 4
--- ---(to p20)
![Page 20: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/20.jpg)
20
Step 5Second Iteration
--- ---
---
(to p21)
![Page 21: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/21.jpg)
21
3rd Iteration of VAM
---
--- ---
---
(to p22)
![Page 22: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/22.jpg)
22
Initial tableau for VAM
(to p8)
![Page 23: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/23.jpg)
23
Optimal solution?
Initial solution from:
Northeast cost, total cost =$5,925
The min cost, total cost =$4,550
VAM, total cost = $5,125(note: here, we are not saying the second one always
better!)
It shows that the second one has the min cost, but is it the optimal solution?
(to p24)
![Page 24: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/24.jpg)
24
Solution methods
• We need a method, like the simplex method, to check and obtain the optimal solution
• Two methods:
1. Stepping-stone method
2. Modified distributed method (MODI)
(to p25)
(to p30)
(to p7)
![Page 25: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/25.jpg)
25
Stepping-stone methodLet consider the following initial tableau from the Min Cost algorithm
These are basicvariables
There areNon-basic variables
Question: How can we introducea non-basic variable into basic variable?
(to p26)
![Page 26: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/26.jpg)
26
Introducea non-basic variable into basic variables
• Here, we can select any non-basic variable as an entry and then using the “+ and –” steps to form a closed loop as follows:
let consider this nonbasic variable
Then we have
(to p27)
![Page 27: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/27.jpg)
27
Stepping stone
+
- +
-
The above saying that, we add min value of all –ve cells into cell that has “+” sign, and subtractsthe same value to the “-ve” cellsThus, max –ve is min (200,25) = 25, and we add 25 to cell A1 and A3, and subtract it from B1 and A3
(to p28)
![Page 28: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/28.jpg)
28
Stepping stone
The above tableaus give min cost = 25*6 + 120*10 + 175*11 175*4 + 100* 5 = $4525
We can repeat this process to all possible non-basic cells in that abovetableau until one has the min cost! NOT a Good solution method
(to p29)
![Page 29: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/29.jpg)
29
Getting optimal solution
• In such, we introducing the next algorithm called Modified Distribution (MODI)
(to p24)
![Page 30: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/30.jpg)
30
Modified distributed method (MODI)
• It is a modified version of stepping stone method• MODI has two important elements:
1. It determines if a tableau is the optimal one
2. It tells you which non-basic variable should be firstly considered as an entry variable
3. It makes use of stepping-stone to get its answer of next iteration
– How it works? (to p31)
![Page 31: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/31.jpg)
31
Procedure (MODI)Step 0: let ui, v , cij variables represent rows, columns, and cost in the transportation tableau, respectivelyStep 1: (a) form a set of equations that uses to represent all basic variables
ui + vj = cij
(b) solve variables by assign one variable = 0
Step2: (a) form a set of equations use to represent non-basic variable (or empty cell) as such
cij – ui – vj = kij
(b) solve variables by using step 1b informationStep 3: Select the cell that has the most –ve value in 2bStep 4: Use stepping-stone method to allocate resource to cell in step 3Step 5: Repeat the above steps until all cells in 2a has no negative value
Example (to p24)(to p32)
![Page 32: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/32.jpg)
32
MODIConsider to this initial tableau:
Step 0: let ui, v , cij variables represent rows, columns, and cost in the transportation tableau, respectively (to p33)
![Page 33: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/33.jpg)
33
Step 0
C3A
Step 1: (a) form a set of equations that uses to represent all basic variables
ui + vj = cij
(to p34)
![Page 34: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/34.jpg)
34
ui + vj = cij
(b) solve variables by assign one variable = 0
(to p35)
![Page 35: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/35.jpg)
35
Set one variable = 0
Because weadded an non-basic variable
Step2: (a & b)
(to p36)
![Page 36: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/36.jpg)
36
Step2: (a & b)
Note this may look difficult and complicated, however, we can add theseV=values into the above tableau as well (to p37)
![Page 37: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/37.jpg)
37
Step2: (a & b), alternative
-1
6-0-7
-1 +2
+5
Step 3: Select the cell that has the most –ve value in 2b
(to p38)
![Page 38: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/38.jpg)
38
Step3
-1
-1 +2
+5
Select either one, (Why?)These cells mean, introduce it will reduce the min z to -1 cost unit
(to p39)
![Page 39: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/39.jpg)
39
Step 4: Use stepping-stone method
+
- +
-
From here we have …. (to p40)
![Page 40: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/40.jpg)
40
Step 4: Use stepping-stone method
Step 5: we repeat steps 1-4 again for the above tableau, we have
(to p41)
![Page 41: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/41.jpg)
41
Step 5
(to p42)
![Page 42: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/42.jpg)
42
Step 5 cont
All positivesSTOP
(to p31)
![Page 43: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/43.jpg)
43
Important Notes
• When start solving a transportation problem using algorithm, we need to ensure the following:
1. Alternative solution
2. Total demand ≠ total supply
3. Degeneracy
4. others
(to p48)
(to p45)
(to p52)
(to p7)
(to p44)
![Page 44: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/44.jpg)
44
Alternative solution
• When on the following k = 0
cij – ui – vj = kij
Why?
(to p43)
![Page 45: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/45.jpg)
45
Total demand ≠ total supply
Note that, total demand=650, and total supply = 600
How to solve it?
We need to add a dummy row and assign o cost to each cell as such ..
(to p46)
![Page 46: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/46.jpg)
46
Dd≠ss
Extra row, since Demand > supply
Other example …… (to p47)
![Page 47: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/47.jpg)
47
Dd≠ss
Extra column is added(to p43)
![Page 48: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/48.jpg)
48
Degeneracy
Example ….. ie, basic variablesin the tableau
(to p49)
![Page 49: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/49.jpg)
49
Degeneracy
m rows + n column – 1 = the number of cells with allocations3 + 3 - 1 = 5
It satisfied.
If failed? …… considering …..
(five basic variables, and above has 5 as well!)
(to p50)
![Page 50: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/50.jpg)
50
Degeneracy
If not matched, then we select an non-basic variable with least cheapest cost and considered it as a new basic variable with assigned 0 allocation to it
(note above has only 4 basic variableonly!)
(to p51)
![Page 51: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/51.jpg)
51
Degeneracy
Added thisNote: we pick this over others because it has the least cost for the Min Z problem!
(to p43)
![Page 52: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/52.jpg)
52
others
1. When one route cannot be used• Assign a big M cost to its cell
(to p43)
If 10 changed to Cannot deliveredThen we assignedM value here
![Page 53: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/53.jpg)
53
Tutorials
• Module B– 1, 5, 8, 13, 21, 34– these questions are attached in the following
slides
![Page 54: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/54.jpg)
54
1
![Page 55: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/55.jpg)
55
![Page 56: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/56.jpg)
56
![Page 57: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/57.jpg)
57
![Page 58: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/58.jpg)
58
![Page 59: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/59.jpg)
59
![Page 60: transportation problem](https://reader030.vdocument.in/reader030/viewer/2022012922/55721250497959fc0b906ace/html5/thumbnails/60.jpg)
60