A modified method for solving the unbalanced TP
by Anju Khandelwal; Avanish Kumar
International Journal of Operational Research (IJOR), Vol. 49, No. 1, 2024

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.

Online publication date: Fri, 12-Jan-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com