文件名称:Anadaptiveantcolonyalgorithmanditssimulation
- 所属分类:
- 人工智能/神经网络/遗传算法
- 资源属性:
- [PDF]
- 上传时间:
- 2012-11-26
- 文件大小:
- 338kb
- 下载次数:
- 0次
- 提 供 者:
- li***
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
蚁群算法是一种新型的进化算法,蚁群算法与其它进化算法同样存在易于限于局部最小点等缺陷.本文提出一种自适应的蚁群算法雌克服上述缺陷。通过自适应地改变算法的挥发度等系数,本文中的算法可以在保证收敛速度的条件下提高解的全局性,通过对TSP问题的仿真证明本文中的算法相对与原始的蚁群算法收敛速度和解的性能椭一定的提高.-Ant colony algorithm is a new evolutionary algorithm, evolutionary algorithm ant colony algorithm also exists with other local minimum points, and so easy to be limited to defects. This paper presents an adaptive ant colony algorithm to overcome these defects in the female. Adaptive algorithm by changing the coefficient of volatility, etc., this algorithm can guarantee the convergence of the conditions to improve the overall solution, the problem through the TSP simulation shows the algorithm in this article relative to the original ant colony algorithm convergence rate reconciliation, to improve the performance of certain ellipsoid.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
一种自适应蚁群算法及其仿真研究.pdf