| 基于改进蚁群算法对最短路径问题的分析与仿真 |
| |
| 引用本文： | 杨中秋,张延华,郑志丽. 基于改进蚁群算法对最短路径问题的分析与仿真[J]. 沈阳化工学院学报, 2009, 23(2): 150-153 |
| |
| 作者姓名： | 杨中秋 张延华 郑志丽 |
| |
| 作者单位： | 沈阳化工学院信息工程学院,辽宁沈阳,110142 |
| |
| 摘 要： | 使用传统蚁群算法求解图的最短路径问题时,随着节点的增加会出现搜索速度变慢且易于陷入局部最优解.针对这个问题,提出一种改进的蚁群算法,通过引入搜索方向和搜索热区机制提高算法的搜索性能.仿真实验证明：改进的蚁群算法较传统的蚁群算法具有更高搜索速度且容易得到全局最优解.
|
| 关 键 词： | 蚁群算法 最短路径 信息素 |
Analysis and Simulation of Shortest Path Problem Based on Modified Ant Colony Algorithm |
| |
| YANG Zhong-qiu,ZHANG Yan-hua,ZHENG Zhi-li. Analysis and Simulation of Shortest Path Problem Based on Modified Ant Colony Algorithm[J]. Journal of Shenyang Institute of Chemical Technolgy, 2009, 23(2): 150-153 |
| |
| Authors: | YANG Zhong-qiu ZHANG Yan-hua ZHENG Zhi-li |
| |
| Affiliation: | (Shenyang University of Chemical Technology, Shenyang 110142, China) |
| |
| Abstract: | When resolving shortest path problem with traditional ant colony algorithms, the denser the node is, the slower the speed is and the easier it is to get local optimization. To deal with this problem, a kind of modified ant colony algorithm is proposed, in which the mechanism of search direction and search hot section are introduced. Simulated experiments show that the modified ant colony algorithms have a higher searching speed and are easier to use to obtain global optimization than the traditional ones. |
| |
| Keywords: | ant colony algorithm shortest path pheromone |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
