 A novel approach to find simple, pragmatic solutions to transportation problemsSatakshi and Vishal V. Henry International Journal of Mathematics in Operational Research, 2024, vol. 27, issue 4, 496-508 Abstract: The transportation problem is a special case of a linear programming problem (LPP), and its goal is to determine the least/optimal shipping cost that satisfies both the supply and demand constraints simultaneously. An initial basic feasible solution (IBFS) is used to determine the optimal solution. Many methods can be found in the literature to find IBFS. Some of them are Vogel's approximation method (VAM), least cost method (LCM), and North West corner method (NWCM). Among these methods, VAM provides a better solution than other existing methods. This paper proposes a new transportation method (SVAM), inspired by VAM to find IBFS. SVAM performs better than VAM with respect to computation time as it takes very less computation time compared to VAM. The SciLab (V6.1.1) programming is used to implement the algorithm for solving the examples and finding the computation times of all the methods. To establish the correctness of the proposed method, many examples are solved and checked for SVAM and compared with VAM and LCM. Keywords: transportation problem; initial basic feasible solution; IBFS; Vogel's approximation method; VAM; least cost method; LCM. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:27:y:2024:i:4:p:496-508 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.