韩斐斐, 刘升. 基于自适应t分布变异的缎蓝园丁鸟优化算法[J]. 微电子学与计算机, 2018, 35(8): 117-121.
引用本文: 韩斐斐, 刘升. 基于自适应t分布变异的缎蓝园丁鸟优化算法[J]. 微电子学与计算机, 2018, 35(8): 117-121.
HAN Fei-fei, LIU Sheng. Adaptivesatin Bower Birdoptimization Algorithm Based on Tdistribution Mutation[J]. Microelectronics & Computer, 2018, 35(8): 117-121.
Citation: HAN Fei-fei, LIU Sheng. Adaptivesatin Bower Birdoptimization Algorithm Based on Tdistribution Mutation[J]. Microelectronics & Computer, 2018, 35(8): 117-121.

基于自适应t分布变异的缎蓝园丁鸟优化算法

Adaptivesatin Bower Birdoptimization Algorithm Based on Tdistribution Mutation

  • 摘要: 缎蓝园丁鸟优化算法是一种新型的元启发式优化算法, 针对其收敛速度慢、寻优精度低的不足, 提出了一种基于自适应t分布变异的缎蓝园丁鸟优化(tSBO)算法.在tSBO算法中引入了自适应t分布变异算子, 使用算法的迭代次数作为t分布的自由度参数来增强种群的多样性, 避免算法陷入局部最优.通过6个标准测试函数对改进算法与FPA, BA和基本SBO算法进行测试比较, 仿真结果表明, 改进算法是可行有效的, 相比于基本SBO算法, 其收敛精度和鲁棒性有了很大程度的提高.

     

    Abstract: The satin bower bird optimization algorithm is a new meta-heuristic optimization algorithm. Due to its slow convergence rate and low optimization accuracy, a satin bower bird optimization based on adaptive t-distribution mutation (tSBO)algorithm is proposed. In the tSBO algorithm, an adaptive t distribution mutation operator is introduced, and the number of iterations of the algorithm is used as the parameter of the degree of freedom of the t distribution to enhance the diversity of the population and prevent the algorithm from falling into the local optimum.The improved algorithm is compared with FPA, BA and basic SBO algorithm through six standard test functions, and the simulation results show that the improved algorithm is feasible and effective. Compared with the basic SBO algorithm, the convergence precision and robustness are greatly improved.

     

/

返回文章
返回