Abstract
Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for finding an initial basic feasible solution of a balanced transportation problem. Number of numerical illustration is introduced and optimality of the result is also checked. Comparison of findings obtained by the new heuristic and the existing heuristics show that the method presented herein gives a better result.
Highlights
Transportation Problem (TP) is a special type of Linear Programming Problem (LPP)
A new and effective algorithm is introduced for finding an initial basic feasible solution of a balanced transportation problem
Kasana and Kumar (2005) [6] proposed Extremum Difference Method (EDM) where they define the penalty as the difference of highest and lowest unit transportation cost in each row and column and allocate as like as the Vogel’s Approximation Method (VAM) procedure
Summary
Transportation Problem (TP) is a special type of Linear Programming Problem (LPP). Transportation plan is mainly used to minimize transportation cost. Kasana and Kumar (2005) [6] proposed EDM where they define the penalty as the difference of highest and lowest unit transportation cost in each row and column and allocate as like as the VAM procedure. Aminur Rahman Khan (2012) [10] presented HCDM by defining pointer cost as the difference of highest and next to highest cost in each row and column of a transportation table and allocate to the minimum cost cell corresponding to the highest three pointer cost. The pointer cost has been calculated only one time by taking the difference between the highest and lowest cell cost for each row and column of the TOCM and make maximum possible allocation to the lowest cost cell corresponding to the highest pointer cost.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
