Improved Average Penalty Cost (IAPC) Method to Obtain Initial Basic Feasible Solution of Transportation Problem
Keywords:
transportation table (TT), IBFS, VAM, LCM
Abstract
Operational planning, scheduling and synchronization of all production activities are the key responsibilities of the management of a manufacturing plant. Transport modeling is one such activity which is directly involved in the production cost. Therefore, it is necessary for the management of the plant to design the transportation process in such way so that the total production cost is minimized, subject to the constraint that cannot be compromised. In the solution procedure of these transportation problems, an initial basic feasible solution (IBFS) is always require to reach at the optimal solution. In this study, a new algorithm is developed to find IBFS. The result of the proposed method is compared with more classical method naming Vogels Approximation Method (VAM) and cost cell based method named Least Cost Method (LCM). Here the number of numerical problems is established and found in 58.3% cases the proposed method provides optimal where the rest of the cases it offers very near to optimal solution. For finding the degree of effectiveness of proposed method a study is carried out and simulation results show that Improved Average Penalty Cost (IAPC) yields better IBFS than VAM and LCM.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2020-05-15
Issue
Section
License
Copyright (c) 2020 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.