带有选择和自适应变异机制的混合蛙跳算法  

Shuffled Frog Leaping Algorithm with Selection and Adaptive Mutation Mechanism

作　　者：刘悦婷[1] 

机构地区：[1]甘肃联合大学电子信息工程学院,兰州730000

出　　处：《计算机工程》2012年第23期206-210,218,共6页Computer Engineering

基　　金：甘肃省自然科学基金资助项目(0916RJZA017);甘肃省科技支撑计划基金资助项目(090GKCA034)

摘　　要：混合蛙跳算法易陷入局部最优,且收敛速度较慢。为此,提出一种带有选择和自适应变异机制的蛙跳算法。引入线性递减的动态惯性权重修正最差青蛙,按照一定的概率选择适应度值较优的青蛙代替较差青蛙,并对每只青蛙个体以不同概率进行自适应变异。仿真结果表明,该算法可以平衡全局搜索和局部搜索,寻优能力强、迭代次数少,解的精度较高,更适合高维复杂函数的优化。Because of the problems of Shuffled Frog Leaping Algorithm（SFLA） such as local optimality and slow convergence rate,a leapfrog algorithm with selection and adaptive mutation mechanism is presented.This algorithm introduces the linear decreasing adaptive inertia weight to correct the poor frog update strategy.It selects the frog with better fitness value to substitute the poor,and makes very frog adaptively mutate with different probability.Simulation results show that this algorithm can balance the global search and local search,and its optimization ability is stronger,the number of iterations is less,the solution is better,and the suitable for high dimensional optimization of complex functions is more.

关 键 词：混合蛙跳算法 选择机制 自适应变异 惯性权重 更新策略 全局最优 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]