首页 | 本学科首页   官方微博 | 高级检索  
     

基于单纯形的双群人工鱼群算法
引用本文:曲良东何登旭. 基于单纯形的双群人工鱼群算法[J]. 计算机应用, 2008, 28(8): 2103-2104
作者姓名:曲良东何登旭
作者单位:广西民族大学 数学与计算机科学学院广西民族大学数学与计算机科学学院
摘    要:针对基本人工鱼群算法中人工鱼漫无目的随机游动或在非全局极值点的大量聚集的不足,提出了一种基于单纯形法的双群人工鱼群算法。在该算法中,两个不同的子群并行游动,通过子群重组进行子群间的信息交换,实现鱼群在解空间的探索和搜索能力,然后通过单纯形法进行局部再搜索。基于典型的函数和实例测试验证,表明该算法收敛速度快、精度高,具有更好的性能。

关 键 词:人工鱼群算法  双群  单纯形法
收稿时间:2008-02-25

Bi-group artificial fish school algorithm based on simplex method
Abstract:After analyzing the disadvantages of artificial fish stochastic moving without a definite purpose or heavy getting together round the local optimum solution in original artificial fish school algorithm, a novel Bi-group Artificial Fish school Algorithm based on Simplex Method (SMBGAFSA) was proposed. In this algorithm, moving of two sub groups was parallelly performed. Information was exchanged when sub groups were reorganized. The group can explore the solution space and search the local part, and then use simplex method to search the local part. Several computer simulation results show that the proposed algorithm can greatly improve the ability of seeking the global excellent result, convergence property and accuracy.
Keywords:Artificial Fish School Algorithm (AFSA)  bi-group  Simplex Method (SM)
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号