Stepping Stone Method
Stepping Stone Method
Stepping Stone Method
Ver esta página en: español Traducir Desactivar para: inglés Opciones ▼
Hire us Support us
(New) All problem can be solved using search box
I want to sell my website www.AtoZmath.com with complete code
Translate this page Home > Operation Research calculators > Optimal solution using stepping stone method example
Seleccionar idioma
Con la tecnología de Traductor de Google
What's new
1. Covariance - Population cov(x,y), Sample
cov(x,y) for X & Y or Class-X & Y on
03.06.19
2. Covariance - Population cov(x,y), Sample
cov(x,y) for bivariate grouped data on
03.06.19
Algorithm
Stepping Stone Method Steps (Rule)
Step-1: Find an initial basic feasible solution using any one of the three methods NWCM, LCM or VAM.
Step-2: 1. Draw a closed path (or loop) from an unoccupied cell. The right angle turn in this path is allowed only at occupied cells and at the original
unoccupied cell. Mark (+) and (-) sign alternatively at each corner, starting from the original unoccupied cell.
2. Add the transportation costs of each cell traced in the closed path. This is called net cost change.
2. Assign this value to selected unoccupied cell (So unoccupied cell becomes occupied cell).
3. Add this value to the other occupied cells marked with (+) sign.
4. Subtract this value to the other occupied cells marked with (-) sign.
Step-5: Repeat Step-2 to step-4 until optimal solution is obtained. This procedure stops when all net cost change ≥ 0 for unoccupied cells.
Example-1
Find Solution using Voggel's Approximation method, also find optimal solution using stepping stone 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
( Enter your problem )
S
We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more Accept
S3 40 8 70 20 18
1 de 4 2/06/19, 6:57 p. m.
transportation problem using stepping stone method (optimal sol... https://cbom.atozmath.com/example/CBOM/Transportation.asp...
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
Table-2
D1 D2 D3 D4 Supply Row Penalty
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
D1 D2 D3 D4 Supply Row Penalty
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
Table-4
D1 D2 D3 D4 Supply Row Penalty
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
Table-5
D1 D2 D3 D4 Supply Row Penalty
( Enter your problem )
S 19(5) 30 50 10(2) 0
We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more Accept
S2 70 30 40 60 9 20 = 60 - 40
2 de 4 2/06/19, 6:57 p. m.
transportation problem using stepping stone method (optimal sol... https://cbom.atozmath.com/example/CBOM/Transportation.asp...
S3 40 8(8) 70 20(10) 0 --
Demand 0 0 7 2
Column
-- -- 40 60
Penalty
Table-6
D1 D2 D3 D4 Supply Row Penalty
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
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 --
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
S 1D 3 S 1D 3 → S 1D 4 → S 2D 4 → S 2D 3 50 - 10 + 60 - 40 = 60
S 2D 1 S 2D 1 → S 2D 4 → S 1D 4 → S 1D 1 70 - 60 + 10 - 19 = 1
S 2D 2 S 2D 2 → S 2D 4 → S 3D 4 → S 3D 2 30 - 60 + 20 - 8 = -18
S 3D 1 S 3D 1 → S 3D 4 → S 1D 4 → S 1D 1 40 - 20 + 10 - 19 = 11
S 3D 3 S 3D 3 → S 3D 4 → S 2D 4 → S 2D 3 70 - 20 + 60 - 40 = 70
2. Select the unoccupied cell having the highest negative net cost change i.e. cell S 2D 2 = - 18.
( Enter your problem )
and draw a closed path from S 2D 2.
We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more Accept
2 2 2 4 3 4 3 2
3 de 4 2/06/19, 6:57 p. m.
transportation problem using stepping stone method (optimal sol... https://cbom.atozmath.com/example/CBOM/Transportation.asp...
D1 D2 D3 D4 Supply
Demand 5 8 7 14
3. Minimum allocated value among all negative position (-) on closed path = 2
Substract 2 from all (-) and Add it to all (+)
D1 D2 D3 D4 Supply
S1 19 (5) 30 50 10 (2) 7
S2 70 30 (2) 40 (7) 60 9
S3 40 8 (6) 70 20 (12) 18
Demand 5 8 7 14
S 1D 3 S 1D 3 → S 1D 4 → S 3D 4 → S 3D 2 → S 2D 2 → S 2D 3 50 - 10 + 20 - 8 + 30 - 40 = 42
S 2D 1 S 2D 1 → S 2D 2 → S 3D 2 → S 3D 4 → S 1D 4 → S 1D 1 70 - 30 + 8 - 20 + 10 - 19 = 19
S 2D 4 S 2D 4 → S 2D 2 → S 3D 2 → S 3D 4 60 - 30 + 8 - 20 = 18
S 3D 1 S 3D 1 → S 3D 4 → S 1D 4 → S 1D 1 40 - 20 + 10 - 19 = 11
S 3D 3 S 3D 3 → S 3D 2 → S 2D 2 → S 2D 3 70 - 8 + 30 - 40 = 52
S1 19 (5) 30 50 10 (2) 7
S2 70 30 (2) 40 (7) 60 9
S3 40 8 (6) 70 20 (12) 18
Demand 5 8 7 14
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here
We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more Accept
4 de 4 2/06/19, 6:57 p. m.