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

Computer Engineering & Science ›› 2023, Vol. 45 ›› Issue (09): 1679-1690.

• Artificial Intelligence and Data Mining • Previous Articles     Next Articles

An improved opposition-based learning equilibrium optimizer algorithm based on neighborhood searching

LI An-dong1,LIU Sheng1,GOU Ru-ru2   

  1. (1.School of Management,Shanghai University of Engineering Science,Shanghai 201620;
    2.College of Cyber Security and Computer,Hebei University,Baoding 071002,China)
  • Received:2022-03-17 Revised:2022-05-13 Accepted:2023-09-25 Online:2023-09-25 Published:2023-09-12

Abstract: To address the problems of low convergence accuracy and easy local optima trapping in the standard Equilibrium Optimizer (EO) algorithm, this paper proposes an Improved Opposition-based learning Equilibrium Optimizer Algorithm based on Neighborhood Searching (IOLEONS) that combines neighborhood topology search. Firstly, the hyperbolic tangent adaptive operator is used to modify the average concentration value in the balance pool to improve the convergence accuracy of the algorithm. Then, the Euclidean distance between particles is calculated, and a neighborhood search mechanism is introduced to further enhance the algorithm's local development ability, better balancing the algorithm's development and exploration stages. Finally, the dynamic symmetric opposite learning strategy with Chebyshev mapping is used to enhance the population's disturbance ability, improve the diversity of the population, and help the population escape from local optima. The convergence of the improved algorithm is analyzed, and eight benchmark test functions are selected in the simulation experiments. The results of Wilcoxon signed-rank test and Friedman rank test show that the improved algorithm has better optimization performance.

Key words: hyperbolic tangent operator, neighborhood searching, Chebyshev mapping;dynamic symmetric opposite learning;equilibrium optimizer