Because of the No Free Lunch (NFL) rule, we are still under the way developing new algorithms and improving the capabilities of the existed algorithms. Under consideration of the simple and steady convergence capability of the sine cosine algorithm (SCA) and the fast convergence rate of the Harris Hawk optimization (HHO) algorithms, we hereby propose a new hybridization algorithm of the SCA and HHO algorithm in this paper, called the CSCAHHO algorithm henceforth. The energy parameter is introduced to balance the exploration and exploitation procedure for individuals in the new swarm, and chaos is introduced to improve the randomness. Updating equations is redefined and combined of the equations in the SCA and HHO algorithms. Simulation experiments on 27 benchmark functions and CEC 2014 competitive functions, together with 3 engineering problems are carried out. Comparisons have been made with the original SCA, HHO, Archimedes optimization algorithm (AOA), Seagull optimization algorithm (SOA), Sooty Tern optimization algorithm (STOA), Arithmetic optimizer (AO) and Chimp optimization algorithm (ChOA). Simulation experiments on either unimodal or multimodal, benchmark or CEC2014 functions, or real engineering problems all verified the better performance of the proposed CSAHHO, such as faster convergence rate, low residual errors, and steadier capability. Matlab code of this algorithm is shared in Gitee with the following address: https://gitee.com/yuj-zhang/cscahho.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9119509PMC
http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0263387PLOS

Publication Analysis

Top Keywords

optimization algorithm
16
sca hho
12
algorithm
10
hybridization algorithm
8
sine cosine
8
harris hawk
8
hawk optimization
8
algorithm sca
8
convergence rate
8
hho algorithms
8

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!