| 一种改进的蚁群算法及其在TSP问题中的检验 |
| |
| 引用本文： | 薛瑞红,李扬.一种改进的蚁群算法及其在TSP问题中的检验[J].科技成果管理与研究,2008(1):41-44. |
| |
| 作者姓名： | 薛瑞红 李扬 |
| |
| 作者单位： | 沈阳化工学院,沈阳,110142 |
| |
| 摘 要： | 蚁群算法是通过模拟蚂蚁觅食而发展出的一种新的启发式算法但是开始的时候信息素缺乏，收敛速度慢一直是蚁群算法的不足。针对该问题，提出加权蚁群算法，它利用传统蚁群算法最优路径的特点，对每个城市分别加权，然后从比较离散的点开始进行寻优。节省了在不可能构成最优路径上的计算时间，提高了运算速度。计算机仿真结果表明，该文算法改进了标准蚁群算法的效率和计算结果的质量。
|
| 关 键 词： | 蚁群算法 信息素 旅行商问题 |
A Weighted Ant Colony Algorithm And Its Test In TSP Problem |
| |
| Xue Rui-hong,LiYang.A Weighted Ant Colony Algorithm And Its Test In TSP Problem[J].Management and Research on Scientific & Technological Achievements,2008(1):41-44. |
| |
| Authors: | Xue Rui-hong LiYang |
| |
| Institution: | (Shenyang Institute of Chemical Technology, The Information and Engineering School, Shenyang 110142, China) |
| |
| Abstract: | Ant colony algorithm is a new heuristic algorithm inspited by the behaviour of ant＇s searching food. Aiming at solve the problems that short of pheromone in the begin and need longer computer time, this paper proposed a weighted ant colony algorithm. Based on the character of the best route weighted for every cities, then from the discrete cities search for best route. The new algorithm improved the searching strategy and consequently saved the computational time on the paths that can not be on the best route. It singnificantly improved the basic ant colony algorithm by accelerating the convergence speed and improved the precision. The simulation proved that the new algorithm improves both the efficiency and the quality of results of the standand ant colony algorithm. |
| |
| Keywords: | Ant colony algorithm Pheremone Traveling saleman problem （TSP） |
| 本文献已被 维普 万方数据 等数据库收录！ |
