摘要
本文给出了带软时间窗的车辆路径问题的一种新的算法,蜂群算法。通过计算若干benchm ark问题,并将结果与硬时间窗的目前最好解及蚁群算法的相应解作比较与分析,验证了算法的有效性。蜂群算法是刚刚起步的智能优化算法,目前国内外关于蜂群算法的文献较少,研究范围较窄,故本文不仅是拓宽蜂群算法应用范围的有效尝试,同时也给本身求解方法不多的软时间窗车辆路径问题提供了一种新解决方法。
This paper proposes a new algorithm,wasp colony algorithm,for vehicle routing problem with soft time windows.Series of benchmark problems are tested and verify the validity of the algorithm through comparing the results with the best known solutions of the VRPTW and the results of the ant algorithm.The wasp colony algorithm has just begun to develop and due to now it has been only used in few problems at home and abroad.Therefore this paper not only expands the application scope of the wasp colony algorithm but also gives a new method to solve the vehicle routing problem with soft time windows which solve methods are few.
出处
《预测》
CSSCI
北大核心
2010年第6期67-70,61,共5页
Forecasting
基金
国家自然科学基金资助项目(70871081)
上海市重点学科建设资助项目(S30504)
关键词
带软时间窗车辆路径问题
蜂群算法
反应阙值
刺激信号值
vehicle routing problem with soft time windows
wasp colony algorithm
response threshold
stimulus value
