库存路径问题的3种策略  

Three Policies of Inventory Routing Problem

作　　者：刘立辉[1] 叶春明[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《公路交通科技》2009年第12期137-141,147,共6页Journal of Highway and Transportation Research and Development

基　　金：上海市研究生创新基金资助项目(JWCXSL0801);上海市重点学科建设资助项目(S30504)

摘　　要：在供应商管理客户库存的模式下,从新的角度全面规划长期的库存路径问题,通盘考虑库存与路径的动态整合。以具有随机需求的客户为重点,循序渐进地研究解决库存路径问题的3种策略:固定区域和固定路线、固定区域和变化路线以及变化区域和变化路线。使用报童库存模型、扫描算法、周期随机库存决策以及节约算法等方法对这3种策略下的库存路径问题进行分别求解,找到每种策略下客户的最佳配送数量和总的最短配送距离。从而,把一个长期的、动态的库存路径问题由短期向长期、由静态向动态进行逐渐过渡,实现更贴近于物流配送实践的数学描述与求解研究,为随机库存路径问题的研究提供一个新的思路。Under the vendor managed inventory （VMI） mode, a long-term inventory muting problem （IRP） was programmed to integrate the inventory and the muting dynamically in a new way. Focused on the customers with stochastic demands, three incremental policies of the IRP, including policy of fixed regions and fixed mutes, policy of fixed regions and varied routes, and policy of varied regions and varied routes, were studied in proper sequence. In the three policies, the IRPs were solved by using newsvendor inventory model, sweep algorithm, decision-making of periodic stochastic inventory and saving ＇algorithm respectively, and the optimal delivery quantity for each customer and the total shortest distribution distance in each policy were found. Thus IRP is transited step by step from short-term and static state to long-term and dynamic state to realize a mathematical description and solution closing to logistic distributing practice, which offers a new approach for the study of the stochastic IRP.

关 键 词：运输经济 整合优化 建模 库存路径问题 随机需求 

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