摘要
为了改进传统的人工鱼群算法会随着迭代的深入而导致算法易陷入局部最优的问题,以及固定的参数导致算法收敛慢和求解精度不高的问题,提出了一种改进的人工鱼群算法.首先结合迭代次数,为移动步长引入一个权值;然后以每条人工鱼的视野范围所构成的子群为小生境,结合子群最优解与当前人工鱼状态,为拥挤度因子引入一个变异策略.数值实验结果表明,本文提出的算法收敛速度快、精度高、鲁棒性强,优于传统的人工鱼群算法和文献[4]提出的算法.
In order to improve the traditional artificial fish swarm algorithm,which is easy to fall into local optimum,and the fixed parameters lead to slow convergence and low precision of the algorithm,during the deepening of the iteration,an improved artificial fish swarm algorithm is proposed.Firstly,by combining the number of iterations,a weight value is introduced for the moving step.Then,taking the subgroup of each artificial fish as the niche,combining the optimal solution of the subgroup with the current state of artificial fish,a variation strategy was introduced for crowding factor.The results of numerical experiments show that the proposed algorithm has the advantages of fast convergence,high accuracy and strong robustness,and is superior to the traditional artificial fish swarm algorithm and the algorithm proposed in literature[4].
作者
林敏
LIN Min(Electronics and Engineering College,Putian University,Putian 351100,China)
出处
《延边大学学报（自然科学版）》
CAS
2018年第4期322-327,共6页
Journal of Yanbian University（Natural Science Edition）
基金
福建省教育厅资助项目(JAT160440)
关键词
人工鱼群算法
子群
移动步长
权值
拥挤度因子
变异策略
artificial fish swarm algorithm
subgroup
moving step length
weight factor
crowding factor
mutation strategy
作者简介
林敏(1980-),女,副教授,研究方向为智能计算、图像处理与模式识别.
