The Vogel's Approximation Method (VAM) is an algorithm used to find an initial feasible solution for transportation problems in operations research and linear programming. This method takes into account the costs associated with transporting goods from suppliers to consumers and seeks to minimize the overall transportation cost. Vogel's Approximation Method is considered an improvement over the North-West Corner and Least Cost Methods as it often provides more accurate initial solutions.
Steps to Apply Vogel's Approximation Method (VAM)
Steps to Apply Vogel's Approximation Method |
Calculate Penalty Values:
For each row and column in the cost matrix, calculate the difference between the two smallest costs (penalty values). This is done by subtracting the smallest cost from the second smallest cost.
Identify the Cell with the Highest Penalty:
Identify the row or column with the highest penalty value. If there is a tie, you can choose either row or column arbitrarily.
Allocate as Much as Possible:
Among the cells in the identified row or column, allocate as much as possible to the cell with the smallest cost. If there is a tie, choose the cell arbitrarily.
Update the supply and demand values accordingly.
Recalculate Penalty Values:
After allocation, recalculate the penalty values for the remaining rows and columns.
Repeat:
Continue the process by identifying the row or column with the highest penalty and allocating to the cell with the smallest cost until all supply and demand requirements are satisfied.
Optimality Check:
Check whether the obtained solution is optimal. Further optimization methods may be applied if needed.
Example of Vogel's Approximation Method:
Consider the following transportation problem with costs and supply/demand constraints:
Advantages of Vogel's Approximation Method (VAM):
Advantages of Vogel's Approximation Method |
Improved Accuracy:
Balancing Effect:
Flexibility:
Wider Applicability:
Basis for Further Optimization:
For More Visit KMBN 206