Vehicle Routing Problem with Stochastic Demand
A type of vehicle routing problem with stochastic demand that follows binomial distribution is discussed in this paper. Partial services policy is adopted to fix the service failure, and a simulation is used to demonstrate the efficiency of this policy. A new two-phase algorithm to solve vehicle routing problem with stochastic demand is researched through combining nested partitions method and scanning algorithm, and the numerical results show its efficiency. Meanwhile, this algorithm also extends the algorithm of vehicle routing problem.
VRP Stochastic Demand Partial Services Nested Partitions Method
Shi-jun Song Jian-ling Jiao
School of Management, Hefei University of Technology, Hefei, China 230009
国际会议
第二届中国对策论及其应用国际学术会议(The Second International Conference on Game Theory and Applications)
青岛
英文
174-179
2007-09-17（万方平台首次上网日期，不代表论文的发表时间）