The gregarious particle swarm optimizer (G-PSO)
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
IEEE Transactions on Evolutionary Computation
Multiswarms, exclusion, and anti-convergence in dynamic environments
IEEE Transactions on Evolutionary Computation
Parallel swarms oriented particle swarm optimization
Applied Computational Intelligence and Soft Computing
| Hi-index | 0.00 |
The particle swarm optimization method (PSO) is one of popular metaheuristic methods for global optimization problems. Although the PSO is simple and shows a good performance of finding a good solution, it is reported that almost all particles sometimes converge to an undesirable local minimum for some problems. Thus, many kinds of improved methods have been proposed to keep the diversity of the search process. In this paper, we propose a novel multi-type swarm PSO which uses two kinds of particles and multiple swarms including either kind of particles. All particles in each swarm search for solutions independently where the exchange of information between different swarms is restricted for the extensive exploration. In addition, the proposed model has the restarting system of inactive particles which initializes a trapped particle by resetting its velocity and position, and adaptively selects the kind of the particle according to which kind of particles contribute to improvement of the objective function. Furthermore, through some numerical experiments, we verify the abilities of the proposed model.