A novel particle swarm optimisation algorithm for continuous function optimisation

K. Rameshkumar, Chandrasekharan Rajendran and K.M. Mohanasundaram

International Journal of Operational Research, 2012, vol. 13, issue 1, 1-21

Abstract: 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.

Keywords: particle swarm optimisation; PSO; dynamic velocity updating; local search; continuous function optimisation; unconstrained optimisation. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=44025 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:13:y:2012:i:1:p:1-21

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().