| 一种具有半动态候选列表的蚁群算法 |
| |
| 引用本文： | 夏维,潘若愚,马溪骏. 一种具有半动态候选列表的蚁群算法[J]. 合肥工业大学学报(自然科学版), 2009, 32(12) |
| |
| 作者姓名： | 夏维 潘若愚 马溪骏 |
| |
| 作者单位： | 合肥工业大学,管理学院,安徽,合肥,230009;合肥工业大学,管理学院,安徽,合肥,230009;合肥工业大学,管理学院,安徽,合肥,230009 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 文章在ACS算法使用的最近邻候选列表的基础上,应用受限生成思想,设计了一种半动态的候选列表生成机制,使得蚁群对于所求解问题产生一定程度的记忆与环境识别能力;运用该方法改进了基本蚁群算法,优化了AS算法的搜索过程;同时,通过仿真实验对比具有半动态候选列表的AS算法与AS算法在计算TSP问题时的结果,验证了算法优化的有效性.
|
| 关 键 词： | 蚁群算法 半动态候选列表 TSP问题 蚂蚁系统 |
Ant colony algorithm with semi-dynamic candidates list |
| |
| XIA Wei,PAN Ruo-yu,MA Xi-jun. Ant colony algorithm with semi-dynamic candidates list[J]. Journal of Hefei University of Technology(Natural Science), 2009, 32(12) |
| |
| Authors: | XIA Wei PAN Ruo-yu MA Xi-jun |
| |
| Abstract: | Based on the nearest neighbor candidate list algorithm of the ant colony system(ACS)and the thought of the process of limited generation,this paper designs a semi-dynamic mechanism to generate a candidates list,making the ant colony solve problems with a certain degree of memory and the ability to identify surroundings.The presented method improves the Ant System(AS)algorithm and optimizes the search process.The basic AS algorithm and the AS algorithm with the semi-dynamic candidates list are applied to the calculation of the basic TSP problem,and the simulation results verify the validity of the improved algorithm. |
| |
| Keywords: | ant colony algorithm semi-dynamic candidates list traveling salesman problem(TSP) Ant System |
| 本文献已被 万方数据 等数据库收录！ |
|
