直接配送下随机需求库存-路径问题最优平稳策略及其算法

中国管理科学 ›› 2014, Vol. 22 ›› Issue (6): 61-68.

直接配送下随机需求库存-路径问题最优平稳策略及其算法

赵达^1,2, 李军³, 马丹祥⁴, 李妍峰³

1. 海南大学经济与管理学院, 海南海口 570228;
2. 华南理工大学工商管理学院, 广东广州 510641;
3. 西南交通大学经济管理学院, 四川成都 610031;
4. 河北联合大学建筑工程学院, 河北唐山 063009

收稿日期:2012-05-10 修回日期:2013-06-12 出版日期:2014-06-20 发布日期:2014-06-26
作者简介:赵达（1980- ），男（汉族），河北易县人，海南大学经济与管理学院，讲师，华面理工大学工商管理学院，博士后，研究方向：物流系统优化.
基金资助:
国家自然科学基金资助项目（71361006，71271178，71001005）；中西部高校综合能力提升计划项目资助；海南大学科研启动基金项目（KYQD1303）；中国博士后科学基金资助项目（2014M552205）

Computing the Optimalstationary Strategy of Stochastic Demand Inventory Routing Problem with Direct Deliveries

ZHAO Da^1,2, LI Jun³, MA Dan-xiang⁴, LI Yan-feng³

1. School of Economics and Management, Hainan University, Haikou 570228, China;
2. School of Business Administration, South China University of Technology, Guangzhou 510641, China;
3. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;
4. College of Civil and Architectural Engineering, Hebei United University, Tangshan 063009, China

Received:2012-05-10 Revised:2013-06-12 Online:2014-06-20 Published:2014-06-26

摘要/Abstract

摘要： 直接配送策略下随机需求库存-路径问题（Stochastic Demand Inventory Routing Problem with Direct Deliveries， SDIRPDD）由于其需求的不确定性、决策的长期性以及其最优策略形式对求解其他库存-路径问题（IRP）的参考价值，使得对SDIPRDD问题的研究成为物流、供应链优化领域研究的一个热点。文章首先证明了无约束SDIRPDD的最优平稳策略为（s，S）形式，并通过分析车辆数约束对客户单阶段期望成本函数的影响，给出了存在车辆数和客户库存容量约束时SDIRPDD问题的最优平稳策略形式，进而提出了一种求解有约束SDIRPDD问题最优平稳策略的近似算法。最后，通过数值算例验证了算法的有效性并分析了结果的现实意义。

关键词: 库存-路径问题, 直接配送, 随机需求, (s,S)策略

Abstract: The stochastic demand inventory routing problem with direct deliveries (SDIRPDD) is a classic and focused issues in logistics and supply chain optimization filed because its demand uncertainty, long-term decision-making and the type of optimal strategy of reference value for solving other kinds of IRP. In this paper, it is proved that optimal stationary strategy's type of SDIPRDD without any restrictions is (s,S) policy, and optimal stationary strategy's type is given,which subject to restrictions of the number of vehicles and customer's inventory capacity through analyzing the influence on one-period expected cost function. Then an approximate algorithm is proposed to compute an optimal stationary strategy under above two restrictions, and efficiency of the algorithm and significance for engineering are analysed through a numerical example. The conclusions of this article have guiding significance for the study of more complex IRP.

Key words: inventory routing problem, direct deliveries, stochastic demand, (s,S) policy

中图分类号:

F253.4

赵达, 李军, 马丹祥, 李妍峰. 直接配送下随机需求库存-路径问题最优平稳策略及其算法[J]. 中国管理科学, 2014, 22(6): 61-68.

ZHAO Da, LI Jun, MA Dan-xiang, LI Yan-feng. Computing the Optimalstationary Strategy of Stochastic Demand Inventory Routing Problem with Direct Deliveries[J]. Chinese Journal of Management Science, 2014, 22(6): 61-68.

参考文献

[1] Federgruen A, Zipkin P. A combined vehicle routing and inventory allocation problem [J]. Operations Research, 1984,32 (5):1019-1036.

[2] Qu W, James H B, Iyogun P. An integrated inventory-transportation system with modified periodic policy for multiple products [J]. European Journal of Operational Research, 1999,115 (2):254-269.

[3] Viswanathan S, Mathur K. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems [J]. Management Science, 1997,43 (3): 294-312.

[4] 王林, 顿踩霞, 张金隆. 基于混合差分进化算法的联合补货-配送优化模型 [J]. 中国管理科学, 2012, 20(3):86-93.

[5] 朱晨波, 叶耀华, 戴锡. 直接配送的三层随机库存路径问题 [J]. 系统工程理论与实践, 2007,12:16-22.

[6] Gallego G, Simchi-Levi D. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems [J]. Management Science, 1990,36 (2): 240-243.

[7] Hall R W. A note on bounds for direct shipping costs [J]. Management Science, 1992,38 (8): 1212-1214.

[8] Bertazzi L. Analysis of direct shipping policies in an inventory-routing problem with discrete shipping times [J]. Management Science, 2008,54 (4): 748-762.

[9] Li Jianxiang, Chen Haoxun, Chu Feng. Performance evaluation of distribution strategies for the inventory routing problem [J]. European Journal of Operational Research, 2010,202 (2):412-419.

[10] Barnes-Schuster D, Bassok Y. Direct shipping and the dynamic single-depot/multi-Retailer inventory system [J]. European Journal of Operational Research, 1997,101 (3): 509-518.

[11] Kleywegt A J, Nori V S, Savelsbergh M W P. The stochastic inventory routing problem with direct deliveries [J]. Transportation Science, 2002,36 (1): 94-118.

[12] Li Jingan, Wu Yue, Lai K K, et al. Replenishment routing problems between a single supplier and multiple retailers with direct delivery [J]. European Journal of Operational Research, 2008,190 (2):412-420.

[13] 刘克. 实用马尔可夫决策过程[M]. 北京:清华大学出版社, 2004.

[14] Veinott A, Wagner H. Computing optimal (s,S) inventory policies [J]. Management Science, 1965,11 (5): 525-552.

[15] Federgruen A, Zipkin P. An efficient algorithm for computing optimal (s,S) policies [J]. Operational Research, 1984,32 (6): 1268-1285.

[16] Zheng Yusheng, Federgruen A. Finding optimal (s,S) policies is about as simple as evaluating a single policy [J]. Operations Research, 1991,39 (4): 654-665.

[17] Federgruen A, Zipkin P. An inventory model with limited production capacity and uncertain demands I. The average-cost criterion [J]. Mathematics of Operations Research, 1986,11 (2): 193-207.

[18] Chen Shaoxiang, Lambrecht M. X-Y band and modified (s, S) Policy [J]. Operations Research, 1996,44 (6): 1013-1019.

[19] Ross S M. Introduction to probability models[M]. 10th ed.Oxford:Academic Press, 2010: 455-457.