A modified method for solving the unbalanced TP

Abstract

Most of the methods suggested for the unbalanced transportation problems in the literature are based on first adding a dummy source/destination with zero cost to make it a balance transportation problem to then obtain the basic feasible solution (BFS). The present paper suggests a modified algorithm for finding a BFS to an unbalanced transportation problem through which we get the optimum solution without adding the dummy source/destination. The method is presented in an algorithmic form and implemented on several sets of input data to test the performance and effectiveness of the algorithm. A comparison is also made with the existing approach and it is found that the suggested algorithm shows better performance.