求解旅行商问题的蚁群搜索算法  

Solving TSP with ant colony algorithms based on ant duplication and death

作　　者：刘显德[1] 唐国维[1] 向明尚[1] 富宇[1] 郝建华[2] 

机构地区：[1]大庆石油学院计算机与信息技术学院,黑龙江大庆163318 [2]大庆师范学院图书馆,黑龙江大庆163453

出　　处：《大庆石油学院学报》2005年第2期60-62,78,126,共5页Journal of Daqing Petroleum Institute

摘　　要：旅行商问题(简称TSP)是一个典型的组合优化问题,结合蚁群算法,提出了基于蚂蚁的复制与死亡、所有蚂蚁同步前进、控制蚂蚁总数量的蚁群搜索算法,并对该算法做仿真实验,仿真结果与公布的最优解相对误差约为1.88%,算法运行时间约为14 min.TSP (Traveling Salesman Problem) is a classic NP-Hard problem in combination. By means of Ant colony Algorithms, this paper proposes ant colony searching algorithms based on ant duplication, ant death, walking on the same speed and controlling ant quantity. The relative error is about 1.88% compared with the optimum solutions obtained before. The running time is about 14 min.

关 键 词：蚁群算法 旅行商问题 优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]