Reinforcement learning-guided Animated Oat Optimization Algorithm with dynamic niching for high-dimensional optimization problems
Jia-Lin Yang , Hao-Ran Sun , Chai-Rui Chen , Ruo-Bin Wang , Lin Xu , Jeng-Shyang Pan , Shu-Chuan Chu
Electronic Research Archive ›› 2025, Vol. 33 ›› Issue (9) : 5536 -5590.
High-dimensional optimization problems face challenges from exponentially expanding search spaces and deceptive local optima resisting metaheuristics. In order to address these issues, a reinforcement learning-guided Animated Oat Optimization Algorithm with a dynamic niching strategy, called RLDN-AOO, is proposed in this research. RLDN-AOO offers the following major novelties: i) a mathematically formulated three-state dynamic niching mechanism that adaptively partitions the population, preserves diversity, and enhances the algorithm’s ability to escape local optima, and ii) a reinforcement learning strategy selection mechanism is proposed to address the issue of the algorithm’s inadequate dynamic adaptability. We compared it with state-of-the-art algorithms (CEC2017, Dim = 50, 100, 200, 500), including LSHADE-SPACMA, CMA-ES variants, and RL-based optimizers. In addition, we applied it in the optimization of BP neural networks. Experimental results showed that RLDN-AOO achieves competitive performance across most benchmarks and, in some cases, performs comparably to LSHADE-SPACMA variants. The source code of RLDN-AOO is openly accessible via https://github.com/robingit77/RLDN-AOO.
Animated Oat Optimization Algorithm / reinforcement learning / dynamic niching / multi-armed bandit / high-dimensional optimization
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
/
| 〈 |
|
〉 |