根据带时间窗车辆路径问题的实际情况,通过考察车辆数和总行程两个目标函数,给出了该问题的一种新的算法——蜂群算法。通过计算若干benchmark问题,并将结果与其他算法相比较分析,验证了算法的有效性。目前关于蜂群算法的文献较少,故不仅是拓宽蜂群算法应用范围的有效尝试,同时也给带时间窗车辆路径问题提供了一种新的解决方法。
This paper proposed a new algorithm, wasp colony algorithm, for VRPTW through comparing the two target function vehicle number and total distance. Series of benchmark problems were tested and verified the validity of the algorithm through comparing the results with the other algortihms. Due to now the wasp colony algorithm is only used in few problems. Therefore, this paper not only expanded the application scope of the wasp colony algorithm, but also gave a new method to solve the vehicle routing problem with time windows.