Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price
This chapter describes a stochastic ship routing problem with inventory management. The problem involves finding a set of least cost routes for a fleet of ships transporting a single commodity when the demand for the commodity is uncertain. Storage at supply and consumption ports is limited and inventory levels are monitored in the model. Consumer demands are at a constant rate within each time period, and in the stochastic problem, the demand rate for a period is not known until the beginning of that period. The demand situation over the time periods is described by a scenario tree with corresponding probabilities. A decomposition formulation is given and it is solved using a Branch and Price framework. A master problem (set partitioning with extra inventory constraints) is built, and the subproblems, one for each ship, are solved by stochastic dynamic programming and yield the columns for the master problem. Each column corresponds to one possible tree of actions for one ship giving its schedule loading/unloading quantities for all demand scenarios. Computational results are given showing that medium sized problems can be solved successfully.
KeywordsStochastic Dynamic Programming Branch and Price Ship Routing Inventory Management.
- 11.Crary, M., Nozick, L., Whitaker, L.: Sizing the U.S. destroyer fleet. Eur. J. Oper. Res. 136, 680–695 (2002)Google Scholar
- 15.Desrosiers, J., Dumas, Y., Solomon, M., Soumis, F.: Time constrained routing and scheduling. In: Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 35–139. North-Holland, Amsterdam (1995)Google Scholar
- 21.Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. Les Cahiers du GERAD G-2004-11 (2004)Google Scholar
- 26.Sherali, H., Al-Yahoob, S., Hassan, M.: Fleet management models and algorithms for an oil-tanker routing and scheduling problem. IIE Trans. 31, 395–406 (1999)Google Scholar