Abstract
The present paper analyses a transshipment problem under uncertain demand with some prohibited routes and upper bounds or capacity restrictions on some routes. The objective is to maximize the net expected revenue, i.e., the total expected revenue minus the transportation and transshipment costs. The stochastic transshipment problem is reduced to an equivalent deterministic transportation problem for which an algorithm has been developed and numerically illustrated.
References
Currin, D.C.: Transportation problems with inadmissible routes. J. Oper. Res. Soc. 37(4), 387–396 (1986)
Dantzig, G.B.: Linear programming under uncertainty. Manage. Sci. 1, 197–206 (1955)
Ferguson, A.R., Dantzig, G.B.: The allocation of aircraft to routes-an example of linear programming under uncertain demand. Manage. Sci. 3, 45–73 (1956)
Garvin, W.W.: Introduction to linear programming. McGraw Hill Book Company, New York (1963)
Herer, Y.T., Tzur, M.: The dynamic transshipment problem. Nav Res Logist Q 48, 386–408 (2001)
Javaid, S., Gupta, S.N., Khalid, M.M.: Stochastic transshipment problem with fractional functional objective. J. Dec. Math. Sci. 4(1–3), 1–10 (1999)
Swarup, K.: Upper bound problem in linear fractional functional programming. Metrika 15, 81–85 (1970)
Orden, A.: The transshipment problem. Manage. Sci. 2, 276–285 (1956)
Rageh, N.S.: “General class of stochastic transportation problems” Operations Research Center, pp. 70–75. Univ. of California, Berkeley (1970). Research Report ORC
Zhao, H., Despande, V., Rayan, J.K.: Emergency transshipment in decentralized dealer network: When to send and accept transshipment requests. Nav. Res. Logist. Q. 53, 547–567 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Javaid, S., Gupta, S.N. A capacitated stochastic linear transshipment problem with prohibited routes. OPSEARCH 48, 30–43 (2011). https://doi.org/10.1007/s12597-011-0040-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12597-011-0040-7