Research on Large-Scale Bi-Level Particle Swarm Optimization Algorithm

Targeting at the slow convergence and the local optimum problems of particle swarm optimization (PSO), a large-scale bi-level particle swarm optimization algorithm is proposed in this paper, which enlarges the particle swarm scale and enhances the initial population diversity on the basis of multi-particle swarms. On the other hand, this algorithm also improves the running efficiency of the particle swarms by the structural advantages of bi-level particle swarms, for which, the upper-level particle swarm provides decision-making information while the lower level working particle swarms run at the same time, enhancing the operation efficiency of particle swarms. The two levels of particle swarms collaborate and work well with each other. In order to prevent population precocity and slow convergence in the later stage, an accelerated factor based on increasing exponential function is applied at the same time to control the coupling among particle swarms. And the simulation results show that the large-scale bi-level particle swarm optimization algorithm is featured in better superiority and stability.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.