Less Is More: A Small-Scale Learning Particle Swarm Optimization for Large-Scale Optimization

LSOP is an essential research topic in the field of evolutionary computation community. Many large-scale optimization algorithms often maintain a large population for diversity enhancement. However, updating such a large population consumes a significant number of fitness evaluations (FEs), which may lead to the insufficient evolution of the population. In light of this, this article proposes a small-scale learning particle swarm optimization (SSLPSO) for solving large-scale optimization problems (LSOPs). In the small-scale learning mechanism, only up to two representative individuals are updated in every generation to effectively save FEs and prolong the evolutionary generations, so as to refine the solution accuracy. Specifically, we first design a representative individual selection (RIS) strategy to select the convergence representative individual and the diversity representative individual for updating. Then, we develop a representative individual learning (RIL) strategy, which includes a convergence learning method and a diversity learning method for the convergence representative individual and the diversity representative individual, respectively. Meanwhile, we further propose an adaptive strategy adjustment (ASA) method based on evolutionary state assessment to determine whether the representative individuals should be updated, further achieving the adaptive adjustment of the evolutionary behavior in the population. Experimental results on the commonly used large-scale test suites, IEEE CEC2010 and IEEE CEC2013, show that the performance of SSLPSO is significantly better than, or at least comparable to other state-of-the-art large-scale optimization algorithms, including the winners of large-scale competitions. Finally, the application of SSLPSO to a large-scale constrained WDN optimization problem further demonstrates its real-world applicability.