需求信息更新时单一仓储中心动态选择策略  

Dynamic Location of Single Storage Center with Demand Information Updating

作　　者：李武强[1] 刘树林[1] 

机构地区：[1]西安交通大学管理学院,陕西西安710049

出　　处：《运筹与管理》2012年第5期61-66,共6页Operations Research and Management Science

基　　金：国家自然科学基金自建群体面对面物流决策行为实验研究(70671080);国家自然科学基金优秀创新群体资助项目(70121001)

摘　　要：研究了需求波动情形下,如何动态选择第三方仓储中心以减少物流成本的问题。首先将需求信息完全预知的单一中心选择问题转化为特殊的最短路问题,并设计了相应的动态规划算法。其次,针对需求波动难以预测的在线问题,从在线策略和竞争分析的角度,设计了简单贪婪策略,并证明了该策略在一般情形下不具有竞争性;而当任一阶段的总运输成本与仓储中心转换成本之比都大于在一定数值时,简单贪婪策略则具备竞争性,并能够有效的控制成本。最后,通过算例验证了动态规划算法与简单贪婪策略的可行性与有效性。Taking into account the variety of demand,feasible strategies about how to locate the single third-party storage center are designed for minimizing the logistics cost.It is shown that the offline problem for which the weight of every point is known in every period in advance can be translated into a special shortest-path problem and solved by the designed dynamic programming algorithm.For the online problem for which the weight of every point cannot be predicted for any future period,we find that the simple greedy strategy is not competitive in general.While the strategy is competitive and cost controlled when the ratio of the overall transportation cost to the transition cost is higher than a certain number for every period.Moreover,the feasibility and the effectiveness of the given strategies are presented according to the analysis of the numeric example.

关 键 词：物流管理 简单贪婪策略 在线算法 仓储选址 

分 类 号：F224.3[经济管理—国民经济] U115[交通运输工程]