具有对数递减权重的混沌正弦余弦算法  

Chaotic Sine Cosine Algorithm Based on Logarithmic Attenuation Weight

作　　者：毕孝儒[1] BI Xiao-ru(Chongqing Nanfang Translators College,SISU,Chongqing 401120)

机构地区：[1]四川外国语大学重庆南方翻译学院,重庆401120

出　　处：《现代计算机》2020年第14期3-8,共6页Modern Computer

基　　金：重庆市大学生创新创业基金项目(No.2017-GX-385、CQGJ17137B)。

摘　　要：对于基本正余弦算法存在的收敛精度低、易陷入局部最优解的问题,提出一种具有对数递减权重的混沌正弦余弦算法。采用对数递减权重描述的非线性权重对当前个体位置进行修正,提高算法收敛精度、加快收敛速度;引入改进Tent混沌搜索策略以有效保持种群多样性,避免算法陷入局部最优。对10个基准测试函数仿真实验,结果表明,与PSO算法、GWO算法、WOA以及几种改进正余弦算法相比,该算法求解精度、收敛速度得到明显改进。To overcome the deficiencies of traditional Sine Cosine Algorithm(SCA),including low convergence accuracy and Easily falling into local optimum,an chaotic sine cosine algorithm based on logarithmic attenuation weight(LACSCA)is proposed.Logarithmic attenuation weight is used to adjust the place of the current individual for raising convergence accuracy and accelerating convergence speed.Chaotic search strategy based on improved Tent is introduced to preserve the diversity of population and avoid falling into local optimum.Simula⁃tion results on 10 benchmark functions show that the proposed algorithm has better performance on solution,and convergence rate than PSO,GWO and WOA algorithms.

关 键 词：正弦余弦算法 对数递减权重 混沌搜索 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]