A Modification to Vogel's Approximation Method to Solve Transportation Problems

Abstract

Transportation Problem (TP) is singular of the paradigms in the Linear Programming Problems (LPP). The TP in Operations Research represent vastly applied optimization. (TP) has some goals, like reducing transportation costs or reducing transportation time, etc. Whereas meeting both supply level and request level requirements. Transportation problem plays a major role in industry, trade, logistics, etc. To get the most possible profit, organizations are always looking for better ways to reduce cost and improve revenue. To solve the transportation problems, it is always required to find an initial basic feasible solution (IBFS) for get the optimal solution. The Vogel's Approximation Method (VAM) is the important known traditional methods for obtaining an IBFS of TP. In this work, we introduce a new modification to the VAM for finding an IBFS for the transportation problems almost nearer to the optimal solve. Proposed modification is illustrated with solved numerical examples. A comparison study was also conducted with the results of classic methods. This modified approach most of times give better solution and very nearer to the optimal solve, furthermore, occasionally gives the optimal solve. This method is clear, easy to comprehend.