A capacitated stochastic linear transshipment problem with prohibited routes

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. Th...

Full description

Saved in:
Bibliographic Details
Published in:Opsearch 2011-03, Vol.48 (1), p.30-43
Main Authors: Javaid, Shakeel, Gupta, S. N.
Format: Article
Language:English
Subjects:
Algorithms
Business and Management
Costs
Linear programming
Management
Mathematics
Operations Research/Decision Theory
Probability distribution
Random variables
Studies
Technical Note
Transportation problem (Operations research)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-011-0040-7