修正固定分区策略下随机需求库存-路径问题的最优策略及其算法

发布时间：2018-04-01 10:11

本文选题：随机需求库存-路径问题　切入点：修正固定分区策略　出处：《系统管理学报》2017年06期

【摘要】：随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem,SDIRP)是典型的NP难题。考虑随机需求环境下,供应链中库存与配送问题的协调优化,是实施供应商管理库存策略的关键所在。对经典固定分区策略(Fixed Partition Policy,FPP)中分区内所有客户必须同时接受配送的基本假设进行了改进,提出了一种分区内按客户需求进行配送的修正FPP策略。首先根据不同分区方案对客户的配送及库存成本的影响给出了一种基于C-W节约法的客户分区算法,并证明了修正FPP策略下各客户任意阶段的最优库存策略形式。进而,设计了求解修正FPP策略下SDIRP问题最优策略的算法。最后,通过数值算例验证了算法的有效性,同时对修正FPP策略的适用性进行了分析。
[Abstract]:Stochastic Demand Inventory Routing problem (SDIRP) is a typical NP problem. It is the key to implement the Vendor managed inventory policy. The basic assumption that all customers in the partition must accept the distribution at the same time in the classic fixed Partition policy is improved. In this paper, a modified FPP strategy is proposed to distribute according to customer's demand. Firstly, according to the effect of different partition schemes on customer's distribution and inventory cost, a customer partition algorithm based on C-W saving method is presented. The optimal inventory policy form of each customer at any stage under modified FPP policy is proved. Furthermore, an algorithm for solving the optimal policy of SDIRP problem under modified FPP policy is designed. Finally, the effectiveness of the algorithm is verified by a numerical example. At the same time, the applicability of the modified FPP strategy is analyzed.
【作者单位】：海南大学经济与管理学院;华南理工大学工商管理学院;西南交通大学经济管理学院;
【基金】：国家自然科学基金资助项目(71361006,71520107001,71371075,71271178) 教育部人文社会科学基金青年项目(17YJC630046) 海南省自然科学基金资助项目(714257)
【分类号】：F274

【相似文献】