| 求解函数优化问题的快速连续蚁群算法 |
| |
| 引用本文： | 马卫,朱庆保. 求解函数优化问题的快速连续蚁群算法[J]. 电子学报, 2008, 36(11): 2120-2124 |
| |
| 作者姓名： | 马卫 朱庆保 |
| |
| 作者单位： | 南京师范大学数学与计算机科学学院,江苏南京,210097;南京师范大学数学与计算机科学学院,江苏南京,210097 |
| |
| 基金项目： | 国家自然科学基金 ， 江苏省自然科学基金 |
| |
| 摘 要： | 用蚁群算法进行函数优化时,存在收敛速度慢并易于陷入局部最小等问题.为此,根据对真实蚂蚁的最新研究成果,提出了一种全新的由侦察蚁和觅食蚁协作搜索的函数优化快速连续蚁群算法.该算法首先引入混沌序列确定侦察蚁的初始位置,然后由侦察蚁进行全局大视域快速搜索,且每迭代完一步和每迭代完一代都要对解进行评价,并对本代最优解的信息素进行标记,由此吸引觅食蚁在本代最优解周围空间进行小步长搜索.通过这种初始化方法和侦察蚁与觅食蚁的相互协作,不仅能很好的提高寻优精度,且使收敛速度大幅提高.计算机仿真实验结果表明,本算法寻优率高,收敛速度提高显著,效果令人满意.
|
| 关 键 词： | 函数优化 连续蚁群算法 混沌序列 侦察蚁 觅食蚁 |
| 收稿时间： | 2007-10-08 |
Fast Continuous Ant Colony Optimization Algorithm for Solving Function Optimization Problems |
| |
| MA Wei,ZHU Qing-bao. Fast Continuous Ant Colony Optimization Algorithm for Solving Function Optimization Problems[J]. Acta Electronica Sinica, 2008, 36(11): 2120-2124 |
| |
| Authors: | MA Wei ZHU Qing-bao |
| |
| Affiliation: | MA Wei,ZHU Qing-bao (School of Mathematics , Computer Science,Nanjing Normal University,Nanjing,Jiangsu 210097,China) |
| |
| Abstract: | Using ant colony algorithm to solve function optimization problems has some disadvantages such as easily plunging into a local minimum,slow convergence speed and so on.Therefore,a new fast continuous ant colony optimization algorithm is presented according to the latest research achievements of ant's behavior,which is carried out by scout ants and foraging ants cooperating with each other to search the best solution for solving function optimization problems.In our algorithm,chaotic sequence is first introd... |
| |
| Keywords: | function optimization continuous ant colony optimization chaotic sequence scout ants foraging ants |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载免费的PDF全文 |
|
