论文标题
横向转运的非平稳批号问题的混合库存政策
A hybrid inventory policy for non-stationary lot-sizing problem with lateral transshipment
论文作者
论文摘要
本文解决了两个储存位置单项非平稳随机批量大小的问题。定期审查每个位置的库存水平。可以从普通的中央仓库重新排序并收到物品，也可以从另一个位置横向地转移。假定横向转移可以主动将两个库存之间的股票重新分配。因此，每个时期的行动顺序为：换式（如有必要），重新排序（如有必要）并满足每个位置和每个安装的需求。成本是针对施工，订购，持有和后订单的。这种系统的关键问题是确定仓库与从仓库到两个位置的订单数量之间的横向转移数量。我们通过随机动态编程提出问题，以最大程度地减少预期的总成本。由于动作的数量随着可行数量的转运和补给而增加，因此我们开发了两阶段的动态编程以提高计算效率。基于混合整数线性编程和后退的方法，引入了针对此两阶段公式的近乎最佳政策。实施数值实验以证明两阶段模型和启发式算法的性能
This paper addresses the two-stocking locations single item non-stationary stochastic lot-sizing problem. The inventory level at each location is reviewed periodically. Items can be reordered and received from a common central warehouse and can also be transshipped laterally from the other location. Lateral transshipment is assumed to be proactive to re-distribute the stock between two stocking locations. Therefore, the order of action in each period is: transshipping (if necessary), reordering (if necessary) and satisfying the demand at each location and each installation. The costs are imposed on transshipping, ordering, holding, and back-ordering. The key issue in such systems is to determine the quantity of the lateral transshipment between depots and the order quantities from the warehouse to both locations. We formulate the problem via stochastic dynamic programming to minimise the expected total cost. Since the number of actions increases exponentially as the feasible quantities of transshipment and replenishment grow, we develop two-stage dynamic programming to improve the computation efficiency. A near-optimal policy against this two-stage formulation is introduced based on a mixed integer linear programming and receding-horizon approach. numerical experiments are implemented to demonstrate the performance of the two-stage model and the heuristic algorithm
