Diyala Journal for Pure Science DJPS

P- ISSN:2222-8373, E-ISSN:2518-9255

Volume 15, Issue 3 , July . 2019

A Comparison Between SPSO and QPSO from View Point of Optimization

Teaba Wala Aldeen Khairi , Wisam Ali Mahmod  , Mohammed Sabah Rasheed

Year: 2019, Volume: 15, Issue: 3

Pages: 162-172 , DOI: https://dx.doi.org/10.24237/djps.15.03.497C

Download :  

Abstract

Particle swarm optimization (PSO) has magnetized different investigators who are concerned in dealing with different optimization problems, due to its ease of implementation and reasonable performance. However, PSO algorithm is trapped in the local optima easily because of the quick loss of the population variance. Hence, enhancement of the performance of PSO and detraction the relaying on factors are led to significant variants of SPSO. One important variant is the quantum behavior of particle swarm optimization (QPSO), which is dependent on the dynamical analysis of SPSO and quantum mechanics. This paper presents a notion for the optimization of nonlinear functions using swarm methodology and a comparison between SPSO and QPSO are given. These two algorithms are analyzed on both unimodal and multimodal, high and low dimensional continuous functions. The results on eight benchmark functions show that the QPSO algorithm can perform much better than the SPSO.

Keywords: SPSO, QPSO, benchmark functions, Meta-heuristic optimization.