混沌映射与t-分布变异策略改进的海鸥优化算法  

Improved seagull optimization algorithm based on chaotic map and t-distributed mutation strategy

作　　者：王娟[1] 秦江涛[1] Wang Juan;Qin Jiangtao(College of Management,University of Shanghai for Science&Technology,Shanghai 200093,China)

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《计算机应用研究》2022年第1期170-176,182,共8页Application Research of Computers

基　　金：国家自然科学基金资助项目(71774111)。

摘　　要：针对海鸥优化算法(SOA)求解精度较低、迭代后期收敛速度慢、易陷入早熟收敛的缺点,提出一种基于混沌映射和t-分布变异改进的海鸥优化算法(CtSOA),采用tent映射策略使初始海鸥种群均匀分布在搜索空间中,采用t-分布变异策略平衡算法的探索和开发能力,综合两种改进策略提高了算法的全局搜索精度和跳出局部极值的能力。在14个测试函数上分别与SOA、其他五种元启发式算法、单一策略改进的SOA以及其他学者改进的SOA进行对比,实验结果表明,综合两种改进策略的CtSOA具有更优的收敛精度和更快的收敛速度。In order to solve the shortcomings of seagull optimization algorithm(SOA),such as low precision,slow convergence rate in the later iteration,and fall into premature convergence easily.This paper proposed an improved seagull optimization algorithm(CtSOA),which combined chaotic map strategy and t-distribution mutation strategy.Tent map strategy made the initial seagull population evenly distributed in the search space,and t-distribution mutation strategy balanced the exploration and development capability of the algorithm.Combining the two strategies,CtSOA had higher global search accuracy and stronger abi-lity to jump out of local extremum.Comparing with the SOA,other five meta-algorithms,the single strategy improved SOA,and other scholars improved SOA on 14 test functions,the experimental results show that CtSOA with two improved strategies has better convergence precision and faster convergence speed.

关 键 词：海鸥优化算法 元启发式算法 TENT映射 T-分布 全局搜索 局部寻优 测试函数 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]