A review of velocity-type PSO variants. Issue 1 (March 2017)

• Record Type: Journal Article
• Authors: Sousa-Ferreira, Ivo; Sousa, Duarte
• Is Part Of: Journal of algorithms & computational technology. Volume 11:Issue 1(2017)
• Page Start: 23
• Page End: 30
• Publication Date: 2017-03
• Subjects: Stochastic algorithms -- particle swarm optimization -- velocity-type -- constrained optimization -- nonlinear programming; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1177/1748301816665021
• Languages: English
• ISSNs: 1748-3018

Abstract

This paper presents a review of the particular variants of particle swarm optimization, based on the velocity-type class. The original particle swarm optimization algorithm was developed as an unconstrained optimization technique, which lacks a model that is able to handle constrained optimization problems. The particle swarm optimization and its inapplicability in constrained optimization problems are solved using the dynamic-objective constraint-handling method. The dynamic-objective constraint-handling method is originally developed for two variants of the basic particle swarm optimization, namely restricted velocity particle swarm optimization and self-adaptive velocity particle swarm optimization. Also on the subject velocity-type class, a review of three other variants is given, specifically: (1) vertical particle swarm optimization; (2) velocity limited particle swarm optimization; and (3) particle swarm optimization with scape velocity. These velocity-type particle swarm optimization variants all have in common a velocity parameter which determines the direction/movements of the particles.