期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 192, 期 1, 页码 69-78出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2007.09.019
关键词
Dynamic programming; Inventory; Stochastic models; Transshipment; Decomposition
资金
- EPSRC [GR/T08562/01]
- Engineering and Physical Sciences Research Council [GR/T08562/01] Funding Source: researchfish
In multi-location inventory systems, transshipments are often used to improve customer service and reduce cost. Determining optimal transshipment policies for such systems involves a complex optimisation problem that is only tractable for systems with few locations. Consequently simple heuristic transshipment policies are often applied in practice. This paper develops an approximate solution method which applies decomposition to reduce a Markov decision process model of a multi-location inventory system into a number of models involving only two locations. The value functions from the subproblems are used to estimate the fair charge for the inventory provided in a transshipment. This estimate of the fair charge is used as the decision criterion in a heuristic transshipment policy for the multi-location system. A numerical study shows that the proposed heuristic can deliver considerable cost savings compared to the simple heuristics often used in practice. (C) 2007 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据