粒子群优化的多群蚂蚁算法  

Multiple colony ant algorithm based on particle swarm optimization

作　　者：喻学才[1,2] 张田文[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 [2]浙江师范大学交通学院,浙江金华321004

出　　处：《哈尔滨工业大学学报》2010年第5期766-769,共4页Journal of Harbin Institute of Technology

摘　　要：设计多蚁群算法的关键是群间的信息交换规则.利用粒子群优化中粒子移动的基本思想研究了蚁群间信息交换的新规则,定义了新的多蚁群优化算法.新算法的信息交换所占用的数据通信量要远低于现有的信息交换方法.将新算法用于求解带时间窗的车辆路由问题并和以前的最好的多蚁群算法做比较,计算结果表明:新算法的性能超过了已有的方法.采用群体智能中个体的移动思想来设计群间信息交换规则能改进多蚁群算法的求解性能.This work suggested a new multi-ACO algorithm by introducing the basic idea in the particle swarm optimization（PSO） into solution information exchange between ant colonies.The new algorithm takes much less cost for exchanging solution information than those existing methods.The new algorithm was used to solve the VRPTW benchmark instances and was compared with one existing algorithm.The results show that the new algorithm out performs the existing methods.Exploiting the idea of individual moving in the swarm intelligence to design the rule of information exchange between ant colonies can improve the performance of multi-ACO algorithm.

关 键 词：蚁群优化 粒子群优化 带时间窗的车辆路由问题 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]