An effective algorithm to solve cost minimising transportation problem

S.M. Abul Kalam Azad and M. Kamrul Hasan

International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 4, 434-445

Abstract: The developed algorithm in this article provides an initial basic feasible solution (IBFS) of the transportation problem (TP) of the linear programming problem. The proposed method, which involves fewer calculations and fewer steps or iterations, is able to provide a better approximate solution to the TP than classical methods, especially Vogel's approximation method (VAM). This method is also easier and more effective than some recent methods to solve TPs, which were introduced by various researches. This article illustrates the simplicity and effectiveness of the developed algorithm by providing a good number of examples.

Keywords: initial basic feasible solution; IBFS; transportation problem; TP; Vogel's approximation method; VAM; transportation table; cost unit. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=103005 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:15:y:2019:i:4:p:434-445

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().