关键词: 交通运输工程, 车辆路径问题, 混合蚁群算法, 最大最小蚂蚁系统, 节约算法, 邻域搜索算法

Abstract: In order to solve the vehicle routing problem (VRP), a new ant colony algorithm based on C-W saving algorithm and local search algorithm was proposed. The hybrid algorithm solved the problem of the standard ant colony algorithm to search for a long time and easy to fall into the local optimal solution. Firstly, C-W saving algorithm was introduced to improve the quality of the initial solution, which made the ant algorithm search in a better way, so it could converge to the optimal solution more effectively. And then, the pheromone of path was controlled by using max-min ant system (MMAS), which avoided the local optimal solution of the algorithm. Finally, the sub-path of optimal solution for a certain stage was optimized by using local search algorithm. The proposed hybrid ant colony algorithm was used to calculate the examples in VRPLIB database, and achieved the satisfactory results.

Key words: traffic and transportation engineering, vehicle routing problem, hybrid ant colony algorithm, max-min ant system, C-W saving algorithm, local search algorithm