An improved chaos sparrow search optimization algorithm using adaptive weight modification and hybrid strategies

Sparrow Search Algorithm (SSA) is a kind of novel swarm intelligence algorithm, which has been applied in-to various domains because of its unique characteristics, such as strong global search capability, few adjustable parameters, and a clear structure. However, the SSA still has some inherent weak...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Xuan-Yu, Zhou, Kai-Qing, Li, Peng-Cheng, Xiang, Yin-Hong, Mohd. Zain, Azlan, Sarkheyli-Hägele, Arezoo
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers Inc. 2022
Subjects:
Online Access:http://eprints.utm.my/104417/1/AzlanMohdZain2022_AnImprovedChaosSparrowSearchOptimization.pdf
http://eprints.utm.my/104417/
http://dx.doi.org/10.1109/ACCESS.2022.3204798
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
Language: English
Description
Summary:Sparrow Search Algorithm (SSA) is a kind of novel swarm intelligence algorithm, which has been applied in-to various domains because of its unique characteristics, such as strong global search capability, few adjustable parameters, and a clear structure. However, the SSA still has some inherent weaknesses that hinder its further development, such as poor population diversity, weak local searchability, and falling into local optima easily. This manuscript proposes an improved chaos sparrow search optimization algorithm (ICSSOA) to overcome the mentioned shortcomings of the standard SSA. Firstly, the Cubic chaos mapping is introduced to increase the population diversity in the initialization stage. Then, an adaptive weight is employed to automatically adjust the search step for balancing the global search performance and the local search capability in different phases. Finally, a hybrid strategy of Levy flight and reverse learning is presented to perturb the position of individuals in the population according to the random strategy, and a greedy strategy is utilized to select individuals with higher fitness values to decrease the possibility of falling into the local optimum. The experiments are divided into two modules. The former investigates the performance of the proposed approach through 20 benchmark functions optimization using the ICSSOA, standard SSA, and other four SSA variants. In the latter experiment, the selected 20 functions are also optimized by the ICSSOA and other classic swarm intelligence algorithms, namely ACO, PSO, GWO, and WOA. Experimental results and corresponding statistical analysis revealed that only one function optimization test using the ICSSOA was slightly lower than the CSSOA and the WOA among the 20-function optimization. In most cases, the values for both accuracy and convergence speed are higher than other algorithms. The results also indicate that the ICSSOA has an outstanding ability to jump out of the local optimum.