| 一种混沌蚁群优化的多约束QoS算法* |
| |
| 引用本文： | 金劲,洪毅,赵付青,余冬梅.一种混沌蚁群优化的多约束QoS算法*[J].计算机应用研究,2011,28(6):2317-2310. |
| |
| 作者姓名： | 金劲 洪毅 赵付青 余冬梅 |
| |
| 作者单位： | 兰州理工大学,电气工程与信息工程学院,兰州,730000 |
| |
| 基金项目： | 国家自然科学基金资助项目(61064011) |
| |
| 摘 要： | 蚁群算法提高算法了精度，但易陷入局部寻优过程，本文利用混沌算法随机性、规律性和遍历性来优化蚁群算法，充分考虑两种算法的优点，并将其结合求解最短QoS路由问题，提高了蚁群算法的搜索范围，仿真实验表明，该算法避免了系统的早熟收敛，并具有较好的稳定性和收敛性。
|
| 关 键 词： | 蚁群算法 信息素优化 混沌混和 优化算法 |
| 收稿时间： | 2010/10/29 0:00:00 |
| 修稿时间： | 2010/12/16 0:00:00 |
Multiple constrained QoS algorithm based on chaos and ant colony optimization |
| |
| JIN Jin,HONG Yi,ZHAO Fu-qing,YU Dong-mei.Multiple constrained QoS algorithm based on chaos and ant colony optimization[J].Application Research of Computers,2011,28(6):2317-2310. |
| |
| Authors: | JIN Jin HONG Yi ZHAO Fu-qing YU Dong-mei |
| |
| Affiliation: | (College of Electronics & Communication, Lanzhou University of Technology,Lanzhou 730000,China) |
| |
| Abstract: | Based on the properties of randomicity, regularity and ergodicity of chaos, chaos searching was combined with the ant algorithms, which was proposed to solve searching the shortest path of QoS routing problem. The mixed algorithms avoided the disadvantage to be trapped into local seeking solution and advanced the scope of the searching area and evolution speed of ant colony. The experimental results show that the mixed algorithm can effectively improve the seeking accuracy of the algorithms and accelerate the speed of convergence. |
| |
| Keywords: | ant colony algorithm pheromone optimization chaos combination optimization algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
