基于蜂群算法的随机需求车辆路径优化问题研究

摘要

研究了随机需求车辆路径优化问题(VRPSD)，在只允许路由失败一次和允许部分服务的情况下，给出了应用人工蜂群算法(ABC)用于求解该问题的具体方案。并针对需求为二项分布的VRPSD问题做了Matlab仿真试验，结果验证了该算法解决VRPSD的可行性。%This paper studied the vehicle routing problem with stochastic demands(VRPSD),and give specific methods with the application of Artificial Bee Colony algorithm(ABC) to solve the problem occurring in the situation that only one time routing failure and partial service are al owed.Matlab simulation has been done for a type of vehicle routing problem with stochastic demand which fol ows binomial distribution,demonstrating the feasibility of the algorithm to solve VRPSD.