Authors: Archana Khurana; Tripti Verma; S.R. Arora
Addresses: School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University, Dwarka Sector-16C, Delhi-110075, India ' School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University, Dwarka Sector-16C, Delhi-110075, India ' Department of Mathematics, HansRaj College, University of Delhi, Delhi-110007, India
Abstract: In this article, we have considered a transshipment problem with the objective to minimise the duration of transportation. The algorithm finds out the optimal time for transportation from origins to destinations with transshipment. The proposed algorithm solves the original transshipment problem by transforming into an equivalent transportation problem and the optimal solution of the original problem is obtained from the optimal solution of the transformed transportation problem. The algorithm involves finite number of iterations and is easy to understand and apply. It can serve the managers by providing the solution to a variety of production distribution problems. We have discussed the case of both balanced as well unbalanced time minimising transshipment problems. Numerical examples to illustrate the proposed algorithm are also presented.
Keywords: transshipment time; time minimisation; transport duration.
International Journal of Shipping and Transport Logistics, 2015 Vol.7 No.2, pp.137 - 155
Available online: 19 Feb 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article