• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science ›› 2020, Vol. 42 ›› Issue (12): 2233-2241.

Previous Articles     Next Articles

A mutually beneficial adaptive satin bowerbird optimization algorithm based on non-uniform mutation

WANG Yi-rou,ZHANG Da-min,FAN Ying#br#   

  1. (College of Big Data and Information Engineering,Guizhou University,Guiyang 550025,China)
  • Received:2020-02-21 Revised:2020-04-27 Accepted:2020-12-25 Online:2020-12-25 Published:2021-01-05

Abstract: To solve the problem that the satin bowerbird optimizer (SBO) is prone to low accuracy and slow convergence, this paper proposes an improved satin bowerbird optimizer (ISBO). Firstly, the non-uniform mutation operator is introduced to dynamically adjust the search step size of each iteration bowerbird, so that the algorithm can quickly and efficiently find the global optimal value. Secondly, the mutually beneficial factor is used to introduce more combinatorial modes to the social part of the algorithm so as to no longer searches around the previous bowerbird, thus obtaining a better optimal solution. Finally, in order to better balance the local and global search ability of the algorithm, the inertia weight factor of cosine change is introduced to update the bowerbird position formula. Convergence rate analysis, Wilcoxon test and 8 benchmark functions are used to evaluate the efficiency of the improved satin bowerbird optimization algorithm. The results show that the improved algorithm has better global search capability and solution robustness, and the optimization precision and convergence speed are also better than the original algorithm. 




Key words: non-uniform mutation, mutually beneficial factor, inertia weight, function optimization, satin bowerbird optimization algorithm