计算机应用与软件
計算機應用與軟件
계산궤응용여연건
Computer Applications and Software
2015年
8期
224-228
,共5页
群智能算法%混合蛙跳算法%柯西变异%分类标准%搜索策略%惯性权重%全局优化
群智能算法%混閤蛙跳算法%柯西變異%分類標準%搜索策略%慣性權重%全跼優化
군지능산법%혼합와도산법%가서변이%분류표준%수색책략%관성권중%전국우화
Swarm intelligence algorithm%Shuffled frog leaping algorithm%Cauchy mutation%Classification criterion%Search strategies Inertia weight%Global optimisation
混合蛙跳算法( SFLA)具有算法简单、控制参数少、易于实现等优点,但在高维优化问题中算法易早熟收敛且求解精度低。为此,提出一种基于新搜索策略的混合蛙跳算法( NSSFLA)。该算法定义了新的粒子分类标准,将所有青蛙按此标准进行分类,每类青蛙按照相应的位置更新公式进行更新;在迭代过程中,每个青蛙个体根据自身状态动态地调整惯性权重,平衡了算法全局搜索和局部搜索的能力;在全局迭代中借鉴柯西变异优化策略思想,并以停滞代数判断是否对最优个体进行优化,避免了族群陷入局部最优。实验仿真表明,NSSFLA的寻优能力强,迭代次数少,解的精度高,更适合高维复杂函数的优化。
混閤蛙跳算法( SFLA)具有算法簡單、控製參數少、易于實現等優點,但在高維優化問題中算法易早熟收斂且求解精度低。為此,提齣一種基于新搜索策略的混閤蛙跳算法( NSSFLA)。該算法定義瞭新的粒子分類標準,將所有青蛙按此標準進行分類,每類青蛙按照相應的位置更新公式進行更新;在迭代過程中,每箇青蛙箇體根據自身狀態動態地調整慣性權重,平衡瞭算法全跼搜索和跼部搜索的能力;在全跼迭代中藉鑒柯西變異優化策略思想,併以停滯代數判斷是否對最優箇體進行優化,避免瞭族群陷入跼部最優。實驗倣真錶明,NSSFLA的尋優能力彊,迭代次數少,解的精度高,更適閤高維複雜函數的優化。
혼합와도산법( SFLA)구유산법간단、공제삼수소、역우실현등우점,단재고유우화문제중산법역조숙수렴차구해정도저。위차,제출일충기우신수색책략적혼합와도산법( NSSFLA)。해산법정의료신적입자분류표준,장소유청와안차표준진행분류,매류청와안조상응적위치경신공식진행경신;재질대과정중,매개청와개체근거자신상태동태지조정관성권중,평형료산법전국수색화국부수색적능력;재전국질대중차감가서변이우화책략사상,병이정체대수판단시부대최우개체진행우화,피면료족군함입국부최우。실험방진표명,NSSFLA적심우능력강,질대차수소,해적정도고,경괄합고유복잡함수적우화。
Shuffled frog leaping algorithm ( SFLA) has the advantages of simple algorithm, less control parameters, and easy to realise, but in high-dimensional optimisation problem, it is easy to be premature convergence and the solution has low precision as well.Therefore, this paper proposes a new search strategy-based shuffled frog leaping algorithm ( NSSFLA) , the algorithm defines a new classification criterion of particles, all the frogs are classified according to the criterion, each species update according to the corresponding position updating formula.In the iterative process, each individual dynamically adjusts the inertia weight according to its own status, which balances the ability of algorithm in global search and local search.In global iteration, the thought of Cauchy mutation optimisation strategy is used as the experience, and whether or not to optimise the best individual is determined by stagnation algebraic, which avoids the population to fall into local optimum.Finally, simulation experiments show that NSSFLA has strong search capability, less number of iterations and higher precision in solution, and is more suitable for the optimisation of complex functions with high dimensionality.