Adaptive crow search algorithm based on population diversity

被引:0
|
作者
He J.-G. [1 ]
Peng Z.-P. [2 ,3 ]
Cui D.-L. [1 ]
Li Q.-R. [1 ]
机构
[1] College of Computer Science, Guangdong University of Petrochemical Technology, Maoming
[2] School of Information Engineering, Jiangmen Polytechnic, Jiangmen
[3] Guangdong Provincial Key Laboratory of Petrochemical Equipment Fault Diagnosis, Guangdong University of Petrochemical Technology, Maoming
关键词
adaptive selection; crow search algorithm; population diversity; search-guided individual; sine-cosine search; swarm intelligence optimization;
D O I
10.3785/j.issn.1008-973X.2022.12.011
中图分类号
学科分类号
摘要
A new adaptive crow search algorithm was proposed to solve the shortcomings of the original crow search algorithm, such as weak control of population diversity, single updating of individual position and low precision of local search. Firstly, multiple search-guided individuals were designed, and an adaptive selection strategy of search-guided individuals was realized based on population diversity at different stages of evolution. The global exploration in the early iteration and local exploitation in the late iteration were achieved using the strategy. Secondly, by combining the idea of sine-cosine search, several flight length control parameters based on linear decline or mixed sine-cosine oscillation decline were used to constructed different search modes for improving the search ergodicity of the algorithm and increasing the probability that the algorithm finding a better solution in the late iteration. Thirdly, to verify the effectiveness of the new algorithm, standard test functions were selected, and the new algorithm was simulated with the original crow search algorithm, the improved crow search algorithms, and other excellent intelligent optimization algorithms. All the algorithms were compared and analyzed in terms of convergence accuracy, convergence speed, stability, Wilcoxon signed rank and Friedman tests. Experimental results show that the performance of the new algorithm is better than that of other comparison algorithms, and the balance between global exploration and local exploitation, convergence accuracy and convergence speed are achieved by the new algorithm. © 2022 Zhejiang University. All rights reserved.
引用
收藏
页码:2426 / 2435
页数:9
相关论文
共 31 条
  • [1] ASKARZADEH A., A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm [J], Computers and Structures, 169, pp. 1-12, (2016)
  • [2] JAIN M, RANI A, SINGH V., An improved crow search algorithm for high-dimensional problems [J], Journal of Intelligent and Fuzzy Systems, 33, 6, pp. 3597-3614, (2017)
  • [3] ZAMANI H, NADIMI-SHAHRAKI M H, GANDOMI A H., CCSA: conscious neighborhood-based crow search algorithm for solving global optimization problems, Applied Soft Computing, 85, (2019)
  • [4] SAYED G I, HASSANIEN A E, AZAR A T., Feature selection via a novel chaotic crow search algorithm [J], Neural Computing and Applications, 31, pp. 171-188, (2019)
  • [5] OUADFEL S, ABD ELAZIZ M., Enhanced crow search algorithm for feature selection, Expert Systems with Applications, 159, (2020)
  • [6] UPADHYAY P, CHHABRA J K., Kapur’s entropy based optimal multilevel image segmentation using crow search algorithm, Applied Soft Computing, 97, (2020)
  • [7] FRED A L, KUMAR S, PADMANABAN P, Et al., Fuzzy-crow search optimization for medical image segmentation [M], Applications of hybrid metaheuristic algorithms for image processing, pp. 413-439, (2020)
  • [8] SAHA A, BHATTACHARYA A, DAS P, Et al., Crow search algorithm for solving optimal power flow problem [C], 2017 Second International Conference on Electrical, Computer and Communication Technologies, pp. 1-8, (2017)
  • [9] FATHY A, ABDELAZIZ A., Single-objective optimal power flow for electric power systems based on crow search algorithm [J], Archives of Electrical Engineering, 67, pp. 123-138, (2018)
  • [10] MOHAMMADI F, ABDI H., A modified crow search algorithm (MCSA) for solving economic load dispatch problem [J], Applied Soft Computing, 71, pp. 51-65, (2018)