| 有限级信息素蚁群算法 |
| |
| 引用本文： | 柯良军,冯祖仁,冯远静.有限级信息素蚁群算法[J].自动化学报,2006,32(2):296-303. |
| |
| 作者姓名： | 柯良军 冯祖仁 冯远静 |
| |
| 作者单位： | 1.西安交通大学系统工程研究所 机械制造系统工程国家重点实验室 西安 710049 |
| |
| 摘 要： | 提出一种新的蚁群算法，将信息素分成有限个级别，通过级别的更新实现对信息素的更新，并且信息素的更新量独立于目标函数值. 文中采用有限马氏链的理论证明算法可以线性地收敛到全局最优解. 针对TSP问题，通过与MMAS和ACS等蚁群算法的数值实验结果进行比较，表明所提出的算法是有效的、鲁棒的.
|
| 关 键 词： | 蚁群算法 有限马氏链 收敛性 TSP问题 |
| 收稿时间： | 2004-12-30 |
| 修稿时间： | 2005-11-07 |
Ant Colony Optimization Algorithm with Finite Grade Pheromone |
| |
| KE Liang-Jun,FENG Zu-Ren,FENG Yuan-Jing.Ant Colony Optimization Algorithm with Finite Grade Pheromone[J].Acta Automatica Sinica,2006,32(2):296-303. |
| |
| Authors: | KE Liang-Jun FENG Zu-Ren FENG Yuan-Jing |
| |
| Affiliation: | 1.Systems Engineering Institute, State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiao-tong University, Xi’an 710049 |
| |
| Abstract: | In the paper, a new class of ant colony optimization algorithm is proposed, in which pheromone is classified into finite grades, pheromone updating is realized by changing the grades, and the updated quantity of pheromone is independent of the objective function values. It is proved by means of finite Markov chains theory that the algorithm converges to the global optimal solutions linearly. Compared with MMAS, ACS and some other ant colony optimization algorithms for the Traveling Salesman Problem, the calculating results demonstrate that the proposed algorithm is effective and robust. |
| |
| Keywords: | Ant colony optimization finite Markov chains convergence Traveling Salesman Problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
