Solving time minimising transshipment problem
by Archana Khurana; Tripti Verma; S.R. Arora
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 7, No. 2, 2015

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.

Online publication date: Fri, 06-Mar-2015

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 Shipping and Transport Logistics (IJSTL):
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