| 蚁群算法解决连续优化问题的新途径 |
| |
| 引用本文： | 孙海鹰,陈崚.蚁群算法解决连续优化问题的新途径[J].山东大学学报(工学版),2009,39(6):24-30. |
| |
| 作者姓名： | 孙海鹰 陈崚 |
| |
| 作者单位： | 孙海鹰 陈崚：扬州大学计算机科学与工程系, 江苏 扬州 225009;
陈崚：南京大学计算机软件新技术国家重点实验室, 江苏 南京 210093 |
| |
| 基金项目： | 国家自然科学基金，江苏省自然科学基金，江苏省教育厅自然科学基金 |
| |
| 摘 要： | 为了克服蚁群算法难以直接处理连续优化问题的缺陷,在保持蚁群算法基本框架的基础上,将传统蚁群算法中蚂蚁由解分量的信息素和启发式的乘积值按比例来决定取值概率的方式,改为根据连续的概率分布函数来取值.并将函数在各个维上的极值点方向作为蚂蚁搜索的启发式信息.在标准测试函数上的试验结果显示,该算法不但具有较快的收敛速度,而且能够有效地提高解的精确性,增强了算法的稳定性.
|
| 关 键 词： | 蚁群算法 约束优化问题 连续函数 |
| 收稿时间： | 2009-07-16 |
A new approach for solving continuous optimization using ant colony optimization |
| |
| SUN Hai-ying,CHEN Ling.A new approach for solving continuous optimization using ant colony optimization[J].Journal of Shandong University of Technology,2009,39(6):24-30. |
| |
| Authors: | SUN Hai-ying CHEN Ling |
| |
| Abstract: | A new approach was proposed for solving continuous optimization problems using ant an colony optimization(ACO) algorithm. The method maintains the framework of the classical ant colony algorithm, and replaces discrete summation by the continuous integral, and replaces discrete frequency distribution by continuous probability distribution in the ant selecting probability formula. The direction towards the maximum in each dimension was used as the heuristic information guiding the ants’ searching. Experimental results on benchmarks show that our algorithm not only has faster convergence speed but also effectively improves the accuracy of solution and enhances its robustness. |
| |
| Keywords: | ant colony optimization(ACO) constrained optimization problems continuous function |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(工学版)》浏览原始摘要信息 |
|
点击此处可从《山东大学学报(工学版)》下载全文 |
