混合蚁群算法求解物流配送车辆路径优化问题研究

Study on the Optimization of Logistics Distribution VRP with Hybrid Ant Colony Algorithm

文中在分析VRP与旅行商问题(TSP)区别的基础上,构造了求解VRP的混合蚁群算法。将蚁群系统(ACS)算法同节约量和局部搜索策略2-opt法相结合来改进基本蚁群算法。仿真实验结果表明混合蚁群算法性能优良,能够有效地求解VRP问题。

This paper builds a hybrid ant colony algorithm to solve Vehicle Routing Problem on the basis of analyzing the similarity and difference between VRP and Traveling Salesman Problem（TSP）. The algorithm is improved from basic Ant Colony Algorithm through combining Ant Colony System（ACS） Algorithm with saving measure and the local searching strategy 2-opt method. Simulation results show that the hybrid ant colony algorithm is feasible and valid for VRP.