A novel particle swarm optimisation algorithm for continuous function optimisation (Q2627239)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6724623
Language Label Description Also known as
default for all languages
No label defined
    English
    A novel particle swarm optimisation algorithm for continuous function optimisation
    scientific article; zbMATH DE number 6724623

      Statements

      A novel particle swarm optimisation algorithm for continuous function optimisation (English)
      0 references
      0 references
      0 references
      31 May 2017
      0 references
      Summary: Particle swarm optimisation (PSO) algorithms are applied in a variety of fields. A good quality solution for a problem depends on the PSO parameters chosen for the problem under study. In this paper, a continuous particle swarm optimisation algorithm is proposed to solve the unconstrained optimisation problems. This paper proposes a novel and simple variation of the PSO algorithm by introducing dynamic updating of velocity without any parameters, such as inertia weight and constriction coefficients that are commonly used in the traditional PSO algorithms. The proposed algorithm is applied to well-known benchmark functions which are commonly used to test the performance of numeric optimisation algorithms, and the results are compared with the existing PSO algorithms. It is found that the proposed algorithm gives superior results in terms of speed of convergence and the ability of finding the solutions of excellent quality.
      0 references
      particle swarm optimisation
      0 references
      PSO
      0 references
      dynamic velocity updating
      0 references
      local search
      0 references
      continuous function optimisation
      0 references
      unconstrained optimisation
      0 references

      Identifiers