On a class of capacitated transshipment problems with bounds on rim conditions
Archana Khurana and
Tripti Verma
International Journal of Mathematics in Operational Research, 2015, vol. 7, issue 3, 251-280
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.
Keywords: dead mileage; capacitated transshipment problem; impaired flow; enhanced flow; bounds; rim conditions; transport costs; empty buses. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.inderscience.com/link.php?id=69142 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:7:y:2015:i:3:p:251-280
Access Statistics for this article
More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().