基于固定分割的库存路径问题最优策略

Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (10): 2389-2393,2463.

基于固定分割的库存路径问题最优策略

奚飞¹, 周永务²

1. 合肥工业大学数学学院, 安徽, 合肥, 230009;
2. 合肥工业大学管理学院, 安徽, 合肥, 230009

收稿日期:2008-06-25 修回日期:2008-10-30 出版日期:2009-10-20 发布日期:2010-01-03
作者简介:奚飞(1984- ),男,硕士研究生,主要研究方向为运筹与决策.E-mail:hf-xifei@163.com
基金资助:
国家自然科学基金(70771034);高等学校博士学科点专项科研基金(20060359007);新世纪优秀人才支持计划(NCET-05-0557)资助课题

Optimal policy of inventory routing problem based on fixed partition

XI Fei¹, ZHOU Yong-wu²

1. Dept. of Mathematics, Hefei Univ. of Technology, Hefei 230009, China;
2. School of Management, Hefei Univ. of Technology, Hefei 230009, China

Received:2008-06-25 Revised:2008-10-30 Online:2009-10-20 Published:2010-01-03

摘要/Abstract

摘要： 针对由单个供应商和多个零售商组成的两级供应链分配系统,研究了一体化的库存路径问题.为了节省整个供应链的费用,重新设计了对零售商的区域分割算法.在此基础上,确定了出零售商订货周期与供应商订货周期的大小关系,通过引入周期比例向量,设计了一个全新的整数倍时间策略,给出了详细的理论分析,证明该策略是最优的整数倍时间策略.数字实验结果表明,该策略比其他策略具有明显优越性.

Abstract: For a two-echelon supply chain system consisting of single-supplier and multi-retailers,the inventory routing problem of centralized supply chains is considered.To reduce the cost of the whole chain,a region partition algorithm for the retailers is redesigned.Based on this,the relationship of the replenishment interval between the retailers and the suppliers is determined.By using interval ratio vector,a new integer-ratio policy is designed.Through a particular theoretical analysis,it is proved that this strategy is the optimal one.Numerical experiment results show that this strategy is evidently better than others.

中图分类号:

O224

奚飞, 周永务. 基于固定分割的库存路径问题最优策略[J]. Journal of Systems Engineering and Electronics, 2009, 31(10): 2389-2393,2463.

XI Fei, ZHOU Yong-wu. Optimal policy of inventory routing problem based on fixed partition[J]. Journal of Systems Engineering and Electronics, 2009, 31(10): 2389-2393,2463.

参考文献

[1] Federgruen A,Zipkin P.A combined vehicle routing and inventory allocation problem[J].Operations Research,1984,32:1019-1036.
[2] Anily S,Federgruen A.One warehouse multiple retailers systems with vehicle routing costs[J].Management Science,1990,36:92-114.
[3] Anily S,Federgruen A.Two-echelon distribution systems with vehicle routing costs and central inventories[J].Operations Research,1993,41:37-47.
[4] 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:240-243.
[5] Anily S,Bramel J.An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory routing problem[J].Discrete Applied Mathematics,2004,145:22-39.
[6] Roundy R.98%-effective integer-ratio lot-sizing for one-warehouse muhi-retailers[J].Management Science,1985,31:1416-1430.
[7] Lee F C,Yao M J.A global optimum search algorithm for the joint replenishment problem under power-of-two policy[J].Computers and Operations Research,2003,30:1319-1333.
[8] Chu C L,Leon V J.Power-obtwo single-warehouse multi-buyer inventory coordination with private information[J].Production Economics,2008,111:562-574.
[9] Hsiao Y C.Optimal single-cycle policies for the one-warehouse multi-retailer inventory distribution system[J].International Journal of Production Economics,2008,114:219-229.
[10] Abdul-Jalbar B,Gutiérres J M,Sicilia J.Single cycle policies for the one-warehouse N-retailer inventory/distribution system[J].Omega,2006,34:196-208.
[11] Abdul-Jalbar B,Gutiérrez J M,Sicilia J.Integer-ratio policies for distribution/inventory systems[J].International Journal of Production Economics,2005,93-94:407-415.
[12] Abdul-Jalbar B,Gutiérrez J M,Puerto J,et al.Policies for inventory/distribution systems:The effect of centralization vs.decentralization[J].International Journal of Production Economics,2003,81-82:281-293.
[13] Yao M J,Lee F C.A new algorithm for one-warehouse multiretailer systems under stationary nested policy[J].Optimization Methods and Software,2006,21:41-56.
[14] Lu L,Marc E P.Approximation procedures for the one-warehouse multi-retailer system[J].Management Science,1994,40:1305-1316.
[15] Christofides N,Eilon S.An algorithm for the vehicle dispatching problem[J].Operational Research Quarterly,1969,20:309-318.