Research On Vehicle Routing Problem With Stochastic Demand Based On Nested Partitions Method

With speedy development of science and technology,step out of global integration,and increasing intensification of marketing competition,logistics,as "the third source of profit",has impacted economic activity increasingly obviously,many enterprises have been conscious that logistic is an important measure to improve the ability of market competiton,and introduced advanced logistical theory and logistical technique to manufacture and operation management of enterprise.Being an important approach to realize logistic rationalization,research on vehicle routing problems(VRP) will help enterprise to reduce logistical cost,improve operation efficiency,and enhance customer satisfaction roundly.Therefore,VRP become a hot research at present.But the existing research for VPR major concentration in demand is definite case,and the algorithm that applied is also relatively unitary.Inthis paper,a new algorithm--Nested Partitions Method is applied to researchingon vehicle routing problem with stochastic demand(VRPSD).First, analyz the present investigation condition of VRP and relevant problems,summarize the existing algorithm applied to VRP,and detail Nested Partitions Method. Then, under the assumption that twice service failures are allowed on each path and part service is adopted,research on the single-depot VRPSD by Nested Partitions Method,and the numerical results show its efficiency. Finally, considering the reality of our country,research on the multi-depot VRPSD which the situation of centre is certain or uncertain,carry out numerical experiments and get desired results.The results make the methods of researching on VRP richer,and have a certain significance to enterprises reducing logistics costs.