Академический Документы
Профессиональный Документы
Культура Документы
Annals of
demand at destinations .
destination ,
and
be the amount of
and
M. A. Hakim
Then the Linear Programming Problem representing the transportation problem is
generally given as
total transportation cost while satisfying all the supply and demand restrictions.
2. Methodology
The study was based on the following Existing Methods
There is several well-known heuristics method in the transportation problem.
Column Minimum Method (CMM)[4]
Row Minimum Method (RMM)[5]
Least Cost Method (LCM)[5]
North West-Corner Method (NWCM)[5]
Vogels Approximation Method (VAM)[5,6,7,8]
3. Findings and Discussion
Algorithm for Vogels Approximation Method (VAM)
VAM is not quite as simple as the Northwest Corner approach, but it facilitates a
very good initial solution as a matter of fact, one that is often the optimal solution.
Vogels approximation method tackles the problem of finding a good initial solution
by taking into account the costs associated with each route alternative. This is
something that the Northwest-corner rule did not do. To apply the VAM,
Researchers first compute for each row and column the penalty faced if we should
ship over the second best route instead of the least-cost route.
The Vogel approximation method is an iterative procedure for computing a
basic feasible solution of the transportation problem.[9,10,11]
Step 1. Identify the boxes having minimum and next to minimum transportation cost
in each row and write the difference (penalty) along the side of the table
against the corresponding row.
204
M. A. Hakim
Step 7. Compute total transportation cost for the feasible cost for the feasible
allocations using the original balanced transportation cost matrix.
4. Numerical Illustration [15]
Consider the transportation problem presented in Table 1.
Table 1: Transportation Table
Destination
Allocation
Supply
30
50
75
20
Demand
20
40
30
10
50
25
175
20
1
3
Supply
Row penalty
30
50
10
20
10
4
3
2
20
4
30
20
20
3
25
75
20
(2)
1
206
Column
Penalty
20
40
30
10
50
25
(2)
(2)
(2)
-------
(1)
(0)
(0)
(0)
(1)
(1)
(1)
(1)
(1)
(1)
(3)
---
(2)
(3)
---------
(0)
(1)
(1)
(1)
(2)
(2)
(0)
(0)
(0)
(0)
(1)
---
Supply
30
50
Row penalty
30
1
10
20
20
20
207
25
10
--- ---
40
2
1
(4) (4)
--- ---
75
M. A. Hakim
4
1
Demand
20
40
30
10
50
25
Column
Penalty
(3)
(3)
(3)
(1)
(1)
(1)
(2)
(2)
(2)
(1)
-----
(6)
(6)
---------
(8)
-----------
(2)
(2)
(2)
(2)
(2)
(2)
(4)
(4)
(4)
(1)
(1)
---
20
(6)
(6) (5)
--- ---
---
The difference between the maximum and next minimum costs in each row
and each column are computed and displayed inside the parenthesis against the
respective columns and rows. The maximum difference is 8 which occur in the 4th
. Allocate Min(50,10)=10 in the
columns. The lowest cost of 4th column is
cell (2,4) and diminish 50 by 10. Since the demand of Destination 4 is exhausted
completely cross off 4th column. Calculate the row and column difference by same
technique in the reduced cost matrix and displayed in the table.
Result:
Total Transportation Cost by Proposed Approximation Method is given by
.
5. Conclusion
Here researchers developed a new algorithm for finding an initial basic feasible
solution of the transportation problem. From example researchers found that Vogels
Approximation Method and Proposed Approximation Method give the same result.
Acknowledgement: The author is very much grateful to the anonymous reviewers
for their valuable suggestions for improvement of the presentation of the paper.
REFERENCES
1. Arsham, H and A.B.Kahn, A simplex-type algorithm for general transportation
problems: An alternative to Stepping-Stone, Journal of Operational Research
Society,40(6) (1989) 581-590.
2. Goyal, S.K., Improving VAM for unbalanced transportation problems, Journal
of Operational Research Society, 35(12) (1984) 1113-1114.
208
209