作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (16): 152-154. doi: 10.3969/j.issn.1000-3428.2011.16.052

• 人工智能及识别技术 • 上一篇    下一篇

一种求解多项式根最大模的区间进化AFSA

李永胜,刘桂青,曲良东   

  1. (广西民族大学数学与计算机科学学院,南宁 530006)
  • 收稿日期:2011-01-25 出版日期:2011-08-20 发布日期:2011-08-20
  • 作者简介:李永胜(1979-),男,讲师、硕士,主研方向:人工鱼群算法,智能算法;刘桂青、曲良东,硕士
  • 基金资助:
    广西自然科学基金资助项目(2010GXNSFB013052);广西民族大学数计学院基金资助项目(2009SJ05);2010年度广西教育厅科研立项基金资助项目“基于蚁群人工鱼算法的QoS组播路由算法研究”(201010LX076)

Interval Evolution Artificial Fish School Algorithm of Finding Polynomial Roots Maximum Module

LI Yong-sheng, LIU Gui-qing, QU Liang-dong   

  1. (College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning 530006, China)
  • Received:2011-01-25 Online:2011-08-20 Published:2011-08-20

摘要: 针对多项式根的最大模求解问题,给出一种求解多项式根最大模的区间进化人工鱼群算法(AFSA)。该算法利用公告板上前后两代的信息,将搜索区间映射到更为有效的区域中,其搜索区间是动态的和进化的,从理论上证明该算法的收敛性。仿真实验结果表明,该算法在求多项式根最大模中是可行有效的,收敛速度快,求解精度高。

关键词: 多项式, 最大模, 单位圆, 人工鱼群算法, 区间进化

Abstract: Aiming at the problem of finding the maximum module of a polynomial roots. An interval evolution Artificial Fish School Algorithm(AFSA) of finding the largest module of a polynomial roots is proposed. The search interval is mapped to more effective area based on bulletin board information, and its search interval is dynamic and evolved. Furthermore, its convergence is proved. Simulation experimental results show that this algorithm is more efficient and feasible to find the largest module of a polynomial roots, the convergent speed is much faster and the accuracy of result is much higher.

Key words: polynomial, maximum module, unit circle, Artificial Fish School Algorithm(AFSA), interval evolution

中图分类号: