On a class of capacitated transshipment problems with bounds on rim conditions Online publication date: Thu, 30-Apr-2015
by Archana Khurana; Tripti Verma
International Journal of Mathematics in Operational Research (IJMOR), Vol. 7, No. 3, 2015
Abstract: The transshipment technique is used to find the shortest route from one point in a network to another point and is useful to truncate the cost of transportation. Inspired by dead mileage problem evaluated in terms of running empty buses from various depots to starting points, in this paper we study capacitated transshipment problems with bounds on total availabilities at sources and total destination requirements. Sometimes because of the budget/political constraints, the total flow of transportation is stipulated by some external decision maker which thereby results in impaired or enhanced flow in the market. This motivated us to explore such problems as a particular case of the original problem. The optimal solution of the specified problem is obtained by transforming it into an equivalent capacitated transportation problem. We have also discussed various situations emerging out of unbalanced capacitated transshipment problems in the form of inequalities and numerical examples are also given to illustrate the theory.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook