An Improved Algorithm for Optimal Solution of Unbalanced Transportation Problems

Abstract

Unbalanced transportation problems are particular kind of transportation problems, but an optimal solution is hard to find for unbalanced transportation problems. Still there is a need for minimizing the transportation cost. Unbalanced–TP deals with two different cases, (i) Excess of accessibility  (ii) Deficiency in accessibility  here in this paper both the cases for getting better optimal solution are discussed. Proposed algorithm is based on dummy rows and dummy columns, by taking the absolute differences (penalty) of Initial & Last cost cells of each row/column in transportation cost-matrix, where the objective function is to find an optimal solution. This method is easy to understand and apply than the other existing methods using Initial Basic Feasible Solution–IBFS. Therefore, the proposed method is very helpful to get optimal solution for unbalanced transportation problems.

Keywords:Initial Basic Feasible Solution–IBFS, Unbalanced Transportation Problems, Dummy Rows & Dummy Columns, Optimal Solution.

DOI: 10.7176/MTM/10-8-02

Publication date: December 31^st 2020