A novel two-subpopulation particle swarm optimization
Zheping Yan, Chao Deng, Jiajia Zhou, Dongnan Chi
Abstract
Zheping Yan, Chao Deng, Jiajia Zhou, Dongnan Chi
Abstract
The performance of the particle swarm is mainly influenced by individual particles experience and group experience in the period of evolution for particle swarm optimization. To make full use of the two factors and effectively improve the particle swarm optimization performance, Introduced a novel Two-subpopulation Particle Swarm Optimization, The proportion of individual experience and group experiences is different in each subpopulation swarm. If the proportion of individual experience greater than the group experience, the particle swarm search space abroad, whereas, the proportion of group experience greater than individual experience, the particle swarm search the local area fully. The proposed Two-subpopulation particle swarm optimization combines both advantages, make the search more fully and not easily into the local minimum points. Finally simulations were carried out and the results showed that the proposed Two-subpopulation particle swarm optimization, obviously better than the basic particle swarm algorithm in search precision and stability.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The performance of the particle swarm is mainly influenced by individual particles experience and group experience in the period of evolution for particle swarm optimization. To make full use of the two factors and effectively improve the particle swarm optimization performance, Introduced a novel Two-subpopulation Particle Swarm Optimization, The proportion of individual experience and group experiences is different in each subpopulation swarm. If the proportion of individual experience greater than the group experience, the particle swarm search space abroad, whereas, the proportion of group experience greater than individual experience, the particle swarm search the local area fully. The proposed Two-subpopulation particle swarm optimization combines both advantages, make the search more fully and not easily into the local minimum points. Finally simulations were carried out and the results showed that the proposed Two-subpopulation particle swarm optimization, obviously better than the basic particle swarm algorithm in search precision and stability.
Key concepts: Particle swarm optimization, Multi-swarm optimization, Swarm behaviour, Metaheuristic, Mathematical optimization, Parallel metaheuristic, Meta-optimization, Computer science