Journal of Jilin University (Information Science Edition) ›› 2025, Vol. 43 ›› Issue (1): 126-133.

Previous Articles     Next Articles

Improved Osprey Optimization Algorithm

TAI Zhiyan1, XING Weikang1, GU Jiacheng1, LIU Ming1, YU Xiaodong2   

  1. 1. School of Mathematics and Statistics, Changchun University of Technology, Changchun 130012, China; 2. School of Information Science and Technology, Shanghai Sanda University, Shanghai 201209, China

  • Received:2023-12-05 Online:2025-02-24 Published:2025-02-24

Abstract:

The L_OOA(An Improved Osprey Optimization Algorithm) is proposed to address the issues of the original OOA (Osprey Optimization Algorithm), which is prone to local optima and slow optimization speed. Firstly, to maintain population diversity, the Tent chaotic mapping strategy is adopted to initialize the individual positions of the population. Secondly, by introducing the Levy strategy to update the position of the Osprey, the Osprey Optimization Algorithm can improve its ability to jump out of local optima. The spiral curve strategy is introduced into the Osprey optimization algorithm to improve its computational accuracy. Finally, comparative

experiments are conducted with other intelligent algorithms on the CEC2021 ( Computational Experimental Competition 2021)testfunction set. Experiments prove that L_OOA has better accuracy and faster speed.

Key words: osprey optimization algorithm, spiral curve strategy, Levy strategy, Tent chaotic mapping

CLC Number: 

  • TP18