带有随机需求的车辆路径选择问题算法研究

为带有随机需求的车辆路径问题（VRPSD）提供一个具有通用性的算法,将一个VRPSD问题转化成带有运力限制的车辆路径问题（CVRP）的有限集,通过解CVRP问题来解决VRPSD问题。为提高解的可靠性引入了安全库存的概念,并运用了蒙特卡罗仿真方法,得到了在不同安全库存水平下每条路径的可靠性。用实例检验所述方法的可靠性和通用性。

A Solution Algorithm for Vehicle Routing Problem with Stochastic Demands

This paper proposes a new solution algorithm to the Vehicle Routing Problem with Stochastic Demands（VRPSD）.The theoretical basis of this algorithm is to transform a given VRPSD problem into solving a limited set of Capacitated Vehicle Routing Problem（CVRP） instances,and then the VRPSD problem can be solved by solving the corresponding CVRP problem.This paper recommends using the concept of safety stock to enhance the reliability of the solutions to above problem.This study also uses Monte Carlo simulation to estimate the reliability each possible path under different level of safety stock.Finally,an example is used to demonstrate the reliability and generality of the described algorithm.