主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2014, Vol. 22 ›› Issue (6): 61-68.

Previous Articles     Next Articles

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

ZHAO Da1,2, LI Jun3, MA Dan-xiang4, LI Yan-feng3   

  1. 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: 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

CLC Number: