固定分区下随机需求IRP问题最优策略及算法  

Optimal strategy and algorithm of stochastic demand inventory routing problem under fixed partition policy

作　　者：赵达[1,2] 李军[3] 马丹祥 李妍峰[3] 

机构地区：[1]海南大学经济与管理学院,海口570228 [2]华南理工大学工商管理学院,广州510641 [3]西南交通大学经济管理学院,成都610031 [4]华北理工大学建筑工程学院,唐山063009

出　　处：《管理科学学报》2016年第12期25-35,70,共12页Journal of Management Sciences in China

基　　金：国家自然科学基金资助项目(71361006;71271178;71131003);中西部综合能力提升计划资助项目(海南大学;ZXBJHXK022);中国博士后科学基金资助项目(2014M552205);教育部人文社会科学研究一般资助项目(12YJA630057);海南省自然科学基金资助项目(714257;20157263)

摘　　要：随机需求库存-路径问题(stochastic demand inventory routing problem,SDIRP)是典型的NP难题,考虑随机需求环境下供应链中库存与配送问题的协调优化,是实施供应商管理库存策略的关键所在.文章的研究基于固定分区策略(fixed partition policy,FPP),在FPP下客户被分为若干个服务区域,在同一区域中的所有客户均被同时配送.根据分区策略对配送以及库存成本的影响提出了基于修正C-W节约算法的客户分区算法,证明了各区域的最优库存策略为(s,S)形式,分区内各客户的库存策略为order-up-to形式,进而设计了求解FPP下SDIRP最优策略的算法.最后,通过数值算例验证了该算法的有效性以及FPP的适用性.The stochastic demand inventory routing problem （SDIRP） is a typical NP-hard problem. It is also the key to implementing vendor managed inventory （VMI） strategy, that is, to coordinate the inventory problem and distribution problem in a stochastic demand environment. This paper studies the SDIRP based on the Fixed Partition Policy （FPP）. Under this policy, customers are partitioned according to the service regions they are in, and customers who are in the same service re- gion are served simultaneously. In this paper, a modified C-W saving algorithm is designed to partition customers, taking into ac- count the impact of partition policy on inventory costs and distribution costs. It is shown that the optimal inventory policy for indi- vidual service region is a （s,S） policy, whereas the inventory policy for customers in each service region is an order-up-to poli- cy. Furthermore, this paper proposes an algorithm to solve SDIRP based on FPP. Finally, a numerical example is presented to confirm the efficiency and applicability of the proposed algorithm.

关 键 词：随机需求库存-路径问题 固定分区策略 (s S)策略 order-up-to策略 修正C-W 节约算法 

分 类 号：F253.4[经济管理—国民经济]