改进的多蚁群系统算法解决具有时间窗约束的车辆路径问题  

Solving Vehicle Routing Problems with Time Windows Using Improved Multiple Ant Colony System Algorithm

作　　者：童瑞 吕明[1] 张捷[1] 

机构地区：[1]南京理工大学自动化学院,江苏南京210094

出　　处：《工业控制计算机》2025年第2期86-87,90,共3页Industrial Control Computer

摘　　要：提出了一种改进的多蚁群系统(IMACS)算法,以解决具有时间窗约束的车辆路径问题(VRPTW)。该算法旨在优化车辆行程总距离并减少所需车辆数量。通过引入交换算子、移位算子和逆算子三种变异算子,IMACS算法在全局信息素更新机制中仅考虑精英蚂蚁,从而增加解的多样性和搜索效率。基于Solomon Benchmark数据集的实验结果表明,IMACS算法能够有效减少总行程距离和所需车辆数量,尤其在复杂的车辆路径规划问题上展现出显著优势。This paper proposes an Improved Multiple Ant Colony System(IMACS)algorithm to solve the vehicle routing problem with time windows(VRPTW).The algorithm aims to optimize the total travel distance and reduce the number of vehicles required.By introducing three mutation operators:swap,shift,and inversion,the IMACS algorithm considers only elite ants in the global pheromone update mechanism,thereby increasing the diversity and search efficiency of the solutions.Experimental results based on the Solomon Benchmark dataset show that the IMACS algorithm can effectively reduce the total travel distance and the number of vehicles needed,especially demonstrating significant advantages in complex vehicle routing planning problems.

关 键 词：具有时间窗限制的车辆路径问题 蚁群算法 路径规划 

分 类 号：U492.22[交通运输工程—交通运输规划与管理] TP18[交通运输工程—道路与铁道工程]