Multi-strategy based bare bones particle swarm for numerical optimisation
Summary: Particle swarm optimisation (PSO) is a population-based stochastic search algorithm, which simulates the social behaviour of bird flocking or fish schooling. Many previous studies have shown that PSO is an effective optimisation technique in evolutionary optimisation community. However, the standard PSO still suffers from premature convergence when solving complex multimodal problems. In this paper, we propose a new PSO algorithm called multi-strategy based bare bones PSO (MPSO). The MPSO introduces generalised opposition-based learning (GOBL) and two neighbourhood search strategies into the original bare bones PSO. Simulation study is conducted on 13 well-known benchmark functions. The results show that MPSO achieves better results than the standard PSO and two other PSO algorithms.
- A novel particle swarm optimisation with hybrid strategies
- An improved diversity-guided particle swarm optimisation for numerical optimisation
- A novel particle swarm optimisation algorithm for continuous function optimisation
- Binary particle swarm optimization with multiple evolutionary strategies
- Quantum behaved particle swarm optimization with neighborhood search for numerical optimization
- A novel particle swarm optimisation with hybrid strategies
- An improved diversity-guided particle swarm optimisation for numerical optimisation
- A novel particle swarm optimisation algorithm for continuous function optimisation
- Pruning strategy based bare bones particle swarm optimization
- Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization
This page was built for publication: Multi-strategy based bare bones particle swarm for numerical optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224003)
