Multi-strategy based bare bones particle swarm for numerical optimisation (Q2224003)

From MaRDI portal
!
WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

scientific article; zbMATH DE number 7305323
Language Label Description Also known as
default for all languages
No label defined
    English
    Multi-strategy based bare bones particle swarm for numerical optimisation
    scientific article; zbMATH DE number 7305323

      Statements

      Multi-strategy based bare bones particle swarm for numerical optimisation (English)
      0 references
      0 references
      3 February 2021
      0 references
      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.
      0 references
      particle swarm optimisation
      0 references
      bare bones PSO
      0 references
      BPSO
      0 references
      generalised opposition-based learning
      0 references
      neighbourhood search
      0 references
      simulation
      0 references

      Identifiers