首页> 中文期刊> 《现代电子技术》 >蚁群优化算法的收敛性分析与研究

蚁群优化算法的收敛性分析与研究

         

摘要

蚁群算法本身存在收敛速度慢、容易陷入局部最优解的缺陷,针对该缺陷提出一些改进的蚁群优化算法.主要讨论蚁群优化算法的收敛性理论及应用,得出蚁群系统和最大最小蚂蚁系统的性能好于蚂蚁系统,而且最大最小蚂蚁系统的性能最好,蚁群系统和最大最小蚂蚁系统是值收敛的,一种特殊的ACOgs,ρ(θ)算法是解收敛的.%The ant colony algorithm has the defect of slow convergence speed and is easy to fall into the local optimal solu-tion,so some improved ant colony optimization algorithms are proposed to elimanite the defect. The convergence theory and ap-plication of the ant colony optimization(ACO)algorithm are discussed mainly in this paper. It is obtained that the performance of the ant colony systen and min-max ant system is higher than that of the ant system,in which the min-max ant system has the highest performance,the ant colony system and min-max ant system are convergent,and a special ACOgs,ρ(θ) algorithm is solu-tion convergent.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号