A COMPARATIVE STUDY OF VAM, ASM, MODIFIED ASM METHOD AND AMSTP IN TRANSPORTATION PROBLEM

Abstract

Transportation problem is one of the predominant areas of operations research. It is a type of linear programming problem designed to minimize the cost of distributing a single product from m sources to n destinations. The objective is to minimize the total shipping cost while satisfying both the supply limit and the demand requirements. Transportation problem has basic feasible solution (BFS) and then from it we obtain the optimal solution. VAM (Vogel's Approximation Method), ASM (Assigning Shortest Minimax)-method, Modified ASM Method and AMSTP (Advanced Method for Solving the Transportation Problem) are some of the approaches for identifying the initial feasible solution that have been compared in this study. Keywords: VAM (Vogel’s Approximation Method), ASM (Assigning Shortest Minimax)-method, Modified ASM Method and AMSTP (Advanced Method for Solving the Transportation Problem).