摘要
对需求量满足二项分布的随机需求车辆路径问题进行了研究,在服务失败时采取允许部分服务的策略,并将嵌套分割算法与扫描算法相结合,给出了一种新的求解随机需求车辆路径问题的两阶段算法,数值试验验证了该算法的有效性。同时,该算法也拓展了车辆路径问题的算法空间。
A type of vehicle routing problem with stochastic demand which follows binomial distribution is discussed in this paper. Partial services policy is adopted to fix the service failure,and 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.
出处
《电脑知识与技术》
2009年第3X期2195-2197,共3页
Computer Knowledge and Technology
