The present paper analyses a transshipment problem under uncertain demand with upper bounds when the routes are prohibited. 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 is developed and numerically illustrated.
