蚁群算法与粒子群优化算法的混合算法.pdfVIP

th Proceedings of the 25 Chinese Control Conference 7-11 August, 2006, Harbin, Heilongjiang 蚁群算法与粒子群优化算法的混合算法 1,2 1 1 3 高 尚 ，蒋新姿 ，汤可宗 ，杨静宇 1. 江苏科技大学电子信息学院，镇江 212003 Email ：gao_shang@ 2.苏州大学江苏省计算机信息处理技术重点实验室，苏州 215006 3.南京理工大学计算机系，南京 210094 摘 要:根据蚁群算法与粒子群优化算法的特性，提出了求解旅行商问题的混合算法。首先随机产生若干组比较 好的解生成信息素分布，然后由蚁群算法根据累计更新的信息素找出若干组解后，再由粒子群算法进行交叉、 变异操作，得到更有效的解。与模拟退火算法、标准遗传算法和蚁群算法进行比较，16种混合算法效果都比较 好，其中交叉策略B和变异策略B的混合算法效果最好。 关键词:蚁群算法,粒子群优化算法,旅行商问题 Hybrid Algorithm Combining Ant Colony Optimization Algorithm with Particle Swarm Optimization 1，2 1 1 3 Gao Shang ，Jiang Xin-zi ，Tang Kezong ，Yang Jingyu 1. School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang 212003 Email ：gao_shang@ 2.Provincial Key Laboratory of Computer Information Processing Technology, Suzhou 215006 3. Department of Computer, Nanjing University Science and Technology, Nanjing 210094 Abstract: By use of the properties of ant colony algorithm and particle swarm optimization , a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopts statistics method to get several initial better solutions and in accordance with them, gives information pheromone to distribute. Second, it makes use of the ant colony algorithm to get several solutions through information pheromone accumulation and renewal. Finally, by using across and mutation operation of particle swa