Abstract

Large-scale optimization problems (LSOPs) have drawn researchers’ increasing attention since their resemblance to real-world problems. However, due to the complex search space and massive local optima, it is challenging to simultaneously guarantee the diversity and convergence of the algorithms. As a widely used evolutionary algorithm with fast convergence, particle swarm optimization (PSO) shows competitive performances on some LSOPs. Nevertheless, it can easily get trapped into local optima. Overcoming the complexity of LSOPs and improving search efficiency have become vital issues. The reinforcement learning method has proven to be an effective technique in self-adaptive adjustment, which can help search for better results in large-scale solution space more effectively. In this paper, we propose a large-scale optimization algorithm called reinforcement learning level-based particle swarm optimization algorithm (RLLPSO). In RLLPSO, a level-based population structure is constructed to improve population diversity. A reinforcement learning strategy for level number control is employed to help improve the search efficiency of RLLPSO. To further enhance the convergence ability of RLLPSO, a level competition mechanism is introduced. The experimental results from two large-scale benchmark test suites demonstrate that, compared with five state-of-the-art large-scale optimization algorithms, RLLPSO shows superiority in most cases.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call