| 一种用于连续寻优的蚁群爬山算法 |
| |
| 引用本文： | 马宇红,张杰. 一种用于连续寻优的蚁群爬山算法[J]. 西南大学学报(自然科学版), 2011, 33(5) |
| |
| 作者姓名： | 马宇红 张杰 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院;西北师范大学学报编辑部; |
| |
| 基金项目： | 国家自然科学基金资助项目(11061030) |
| |
| 摘 要： | 针对蚁群算法在连续寻优过程初期信息素匮乏、搜索时间长、收敛慢的弱点,对蚁群算法进行改进,并结合爬山算法提出了一种新的蚁群爬山算法.将新的蚁群爬山算法用于求解连续全局优化问题,数值实验证明该算法是可行的、有效的,并且精度和效率优于蚁群算法.
|
| 关 键 词： | 蚁群算法 爬山法 连续全局优化 信息素 |
An Improved Ant Colony Hill-Climbing Algorithm for Continuous Optimization |
| |
| MA Yu-hong,,ZHANG Jie.College of Mathematics , Information Science,Northwest Normal University,Lanzhou Gansu ,China,.Editorial. An Improved Ant Colony Hill-Climbing Algorithm for Continuous Optimization[J]. Journal of southwest university (Natural science edition), 2011, 33(5) |
| |
| Authors: | MA Yu-hong ZHANG Jie.College of Mathematics Information Science Northwest Normal University Lanzhou Gansu China .Editorial |
| |
| Affiliation: | MA Yu-hong1,2,ZHANG Jie11.College of Mathematics and Information Science,Northwest Normal University,Lanzhou Gansu 730070,China,2.Editorial Department of the University Journal |
| |
| Abstract: | Due to the weaknesses of initial pheromone shortage,long searching time and slow convergence of the existing ant colony algorithms in the process of continuous optimization,a new ant colony hill-climbing algorithm is put forward in this paper by improving the ant colony algorithm and combining it with the hill-climbing process.Used to solve continuous global optimization problems,the improved algorithm is shown to be feasible and effective,and superior to the existing ant colony algorithms in accuracy and e... |
| |
| Keywords: | ant colony algorithm hill-climbing continuous global optimization pheromone |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《西南大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《西南大学学报(自然科学版)》下载全文 |
|
