An effective algorithm to solve cost minimising transportation problem
Summary: 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.
- An alternative solution algorithm for certain transportation problems
- The triple test algorithm to get feasible solution for transportation problems
- Maximum difference extreme difference method for finding the initial basic feasible solution of transportation problems
- scientific article; zbMATH DE number 7274168 (Why is no real title available?)
- A discrete \(\theta(D)\) algorithm designed to increase the convergence speed in solving transport-type problems
- RC-MMM method for finding an optimal solution for transportation problem
- A new way for solving transportation issues based on the exponential distribution and the contraharmonic mean
This page was built for publication: An effective algorithm to solve cost minimising transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2205100)
