| 带有侦察子群的蚁群系统 |
| |
| 引用本文： | 许剑,吕志民,徐金梧.带有侦察子群的蚁群系统[J].北京科技大学学报,2006,28(8):794-798. |
| |
| 作者姓名： | 许剑 吕志民 徐金梧 |
| |
| 作者单位： | 北京科技大学高效轧制国家工程研究中心,北京,100083 |
| |
| 摘 要： | 针对基本蚁群算法收敛速度慢、容易出现停滞等缺陷,提出一种新的蚁群优化算法--带有侦察子群的蚁群系统.该算法从整个蚁群中分离出一部分蚂蚁组成侦察子群,在优化过程中侦察子群以一定概率做随机搜索,提高了解的多样性;在信息素更新策略上同时使用本代和全局最优蚂蚁,兼顾了本代和历史的搜索成果;同时还采用LK变异算子,对每次搜索的解进行局部优化.最后对三个典型TSP实例进行了仿真实验,结果表明新的算法不仅能够克服早熟现象,而且能够大大加快收敛速度.
|
| 关 键 词： | 蚁群系统 蚁群算法 蚁群优化 随机搜索 变异算子 子群 蚁群系统 算法收敛速度 早熟现象 结果 仿真实验 优化过程 局部 变异算子 随机搜索 历史 全局最优 使用 更新策略 信息素 概率 组成 蚂蚁 分离 蚁群优化算法 |
| 收稿时间： | 2005-04-19 |
| 修稿时间： | 2005-10-31 |
An ant system with scouting subgroup |
| |
| XU Jian,L Zhimin,XU Jinwu.An ant system with scouting subgroup[J].Journal of University of Science and Technology Beijing,2006,28(8):794-798. |
| |
| Authors: | XU Jian L Zhimin XU Jinwu |
| |
| Institution: | National Engineering Research Center for Advanced Rolling Technology, University of Science and Technology Beijing, Beijing 100083, China |
| |
| Abstract: | To solve the disadvantages of the basic ant colony algorithm including slow convergent speed and incidental stagnation behavior,a new ant colony optimization algorithm,named the ant system with scouting subgroup (ASSS),was proposed. In the algorithm a small part of ants were separated and formed a scouting subgroup that random moved at a certain probability to increase results diversity. The pheromone update strategy used the iteration-best-ant and global-best-ant at the same time to make use of both iteration-fruit and history-fruit. LK mutation factor was employed to locally optimize the search results of each step. Three typical traveling salesman problems (TSP) were tested,and the results show that this proposed algorithm can avoid prematurity and speed up convergence. |
| |
| Keywords: | ant system ant colony algorithm ant colony optimization random search mutation factor |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
