Comparitive Study of Various Methods for Solving Transportation Problem

Dr S.Kumaraguru; Mr. B. Satheesh Kumar; Mrs M.Revathy

Volume : III, Issue : IX, September - 2014

Comparitive Study of Various Methods for Solving Transportation Problem

Dr S. Kumaraguru, Mr. B. Satheesh Kumar, Mrs M. Revathy

Abstract :

In this paper �Various method are compared for finding an optimal solution. The methods are NWC, LCM, VAM, NMD and Zero Suffix Method all gives an optimal solution. In this paper the best optimality condition has been checked. Numerical examples are provided to illustrate the condition.. The Simplex method is not suitable for the Transportation Problem especially for large Scale transportation problem due to its special Structure of the model in 1954 Charnes and Cooper was developed Stepping Stone method for the efficiency reason. An Initial Basic Feasible Solution(IBFS) for the transportation problem can be obtained by using the north–west corner rule row minima, Coiumn minima, Matrix minima and Vogel�s Approximation Method [Reinfeld and Vogel 1958,Goyal�s version of VAM ..Kirca and Stair developed a heuristic method to obtain an efficient initial basic feasible solution. Sudhakar etal proposed zero suffix method for finding an optimal solution for transportation problem directly in 2012