Global Journal of Engineering and Technology Advances, 2020, 03(03), 001–006

Global Journal of Engineering and Technology Advances

Cross Ref DOI: 10.30574/gjeta
Journal homepage: http://www.gjeta.com

(R E V I E W A R T I C L E )

The particle swarm optimization (PSO) algorithm application – A review

Ovat Friday Aje 1, * and Anyandi Adie Josephat 2
1 Department of Mechanical Engineering, Cross River University of Technology, Calabar- Nigeria.
2 Department of mechanical engineering, Michael Okpara University of Agriculture, Umudike, Abia State, Nigeria.

Publication history: Received on 27 May 2020; revised on 14 June 2020; accepted on 17 June 2020

Article DOI: https://doi.org/10.30574/gjeta.2020.3.3.0033

Abstract
Particle Swarm Optimization (PSO) is one of the concepts of swarm intelligence inspired by studies in neurosciences,
cognitive psychology, social ethology and behavioural sciences, introduced in the domain of computing and artificial
intelligence as an innovative collective and distributed intelligent paradigm for solving problems, mostly in the domain
of optimization, without centralized control or the provision of a global model. The PSO method has roots in genetic
algorithms and evolution strategies and shares many similarities with evolutionary computing such as random
generation of populations at system initialization or updating generations at optima search. This paper presents an
extensive literature review on the concept of PSO, its application to different systems including electric power systems,
modifications of the basic PSO to improve its premature convergence, and its combination with other intelligent
algorithms to improve search capacity and reduce the time spent to come out of local optimums.

Keywords: Swarm; Algorithm; Optimization; Particle; Application

1. Introduction
The method of particle optimization (PSO) is one of the concept of swarm intelligence [1] inspired by studies in
neurosciences, cognitive psychology, social ethology and behavioural sciences, introduced in the domain of computing
and artificial intelligence [2] as an innovative, collective and distributed intelligent paradigm for solving problems,
mostly in the domain of optimization, without centralized control or the provision of a global model [3, 4].

In the utilization of PSO for multivariable optimization problems, the swarm takes a specified size corresponding to the
variables of the objective function(s). The particles are individually located with initial random locations with zero
velocity in the multidimensional design space. Particles of the swarm represent possible solutions in the search pace,
possessing position and velocity [5].

In this particle arrangement and behaviours, each particle keeps track of its positions in the search space and its
behaviour will depend on the best position it has discovered and on the best overall position that any member of the
swarm has achieved so far. With this behavioural arrangement, gross effect of the design space is optimized. The PSO
method works by considering the parametric optimization as an unconstrained D-dimensional minimization problem
as follows [6].

Min 𝑓(𝑥) = [𝑥 1 , … 𝑥 𝑗 . . 𝑥 𝐷 ]- - - - - - - - 1

Where 𝑥 1 , … 𝑥 𝑗 . . 𝑥 𝐷 are particles to be optimized in the form of a D-dimensional vector(𝑓(𝑥)).

𝑗 𝑗
As already outlined, each particle has position and velocity at any time t, so that, 𝑥𝑖 and 𝑣𝑖 are the position and velocity
respectively of the 𝑖𝑡ℎ particle on the 𝑗𝑡ℎdimensional space. As the swarms meanders in the search space, individual
positions and velocities are updated as follows: [7, 5 and 8].


Corresponding author: Ovat Friday Aje
Copyright © 2020 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0.
 Ovat and Anyandi / Global Journal of Engineering and Technology Advances, 2020, 03(03), 001–006

𝑗 𝑗 𝑗. 𝑗 𝑗 𝑗 𝑗
𝑣𝑖 = 𝑤. 𝑣𝑖 + 𝐶𝑖 r and 1𝑖 (𝑃𝑏𝑒𝑠𝑡𝑖 − 𝑥𝑖 ) + 𝐶2 r and 2𝑖 ,(𝑔𝑏𝑒𝑠𝑡 𝑗 − 𝑥𝑖 ), - - 2

𝑗 𝑗 𝑗
𝑥𝑖 = 𝑥𝑖 + 𝑉𝑖 . 𝛥𝑡. - - - - - 3

𝑗
Where: 𝑥𝑖 = (𝑥𝑖1 … … 𝑥𝑖 … … . 𝑥𝑖𝐷 )- - - - - - 4

𝑗
𝑉𝑖 = (𝑣𝑖1 … … 𝑣𝑖 … … . 𝑣𝑖𝐷 ) - - - - - 5

Equations 4 and 5 represents the position and velocity of the ith particle in the D-dimensional search space.

𝑗
𝑃𝑏𝑒𝑠𝑡𝑖 = (𝑃𝑏𝑒𝑠𝑡𝑖1 … 𝑃𝑏𝑒𝑠𝑡𝑖 … 𝑃𝑏𝑒𝑠𝑡𝑖𝐷 ) - - - - - - 6

𝑗
𝑔𝑏𝑒𝑠𝑡𝑖 = (𝑔𝑏𝑒𝑠𝑡𝑖1 … 𝑔𝑏𝑒𝑠𝑡𝑖 … 𝑔𝑏𝑒𝑠𝑡𝑖𝐷 ) - - - - - - 7

Equations 6 and 7 represents the best position of the ith particle and the overall best position of the swarm so far. Δt is
the time interval or step between iterations; 𝐶1 and 𝐶2 , the acceleration constants representing cognitive and social
𝑗 𝑗
learning rates; 𝑟𝑎𝑛𝑑 1𝑖 and 𝑟𝑎𝑛𝑑 2𝑖 are randomly generated numbers. The inertia weights necessary to balance the
global and local search abilities is represented with w.

2. PSO algorithm combined with other intelligent algorithms

While iteratively searching for optimal particles, premature convergence is one of the limitations of the PSO algorithm.
To reach to an optimum value, particle swarm optimization depends on interaction between particles. If this interaction
is restrained algorithm’s searching capacity will be limited, thereby requiring long time to come out of local optimums
[9]. Many developments including combination of PSO with other intelligent algorithm have been developed to solve
this problem. An improved algorithm for Particle Swarm Optimization (PSO) named Elite Particle Swarm Optimization
with Mutation (EPSOM) was proposed by [10]. The EPSOM algorithm improves the individual quality of the swarm and
accelerates the convergence. Meanwhile, mutation operation which is employed in this new algorithm is to guarantee
the diversity of the swarm and to decrease the risk of plunging into local optimum.

A novel particle swarm optimization algorithm [11]: Multi-Swarm and Multi-Best particle swarm optimization
algorithm. In order to make full use of the searching information, the novel algorithm updates the population’s position
and velocity by following multi-pbest and multi-gbest instead of single pbest and single gbest. Accordingly, the
population is not trapped by local optimum position easily.

To solve the premature convergence problem of the PSO, [20] proposed a novel particle swarm optimization based on
swarm particles equilibrium distribution. A new particle which can measure the swarm equilibrium of distribution
degree was proposed to effectively avoid particle clustering within a sub-area of the search space.

In modified particle swarm optimization (PSO) algorithm [12]. Their method integrates the particle swarm optimization
with the simulated annealing algorithm. It can solve the problem of local minimum of the particle swarm optimization,
and narrow the field of search continually, so it has higher efficiency of search. The algorithm was applied to the function
optimization problem and simulation shows that the algorithm is effective.

Another hybrid particle swarm optimization (OPSO) algorithm, which combines the advantages of Neider-Mead simplex
method (SM) and particle swarm optimization (PSO) algorithm to solve systems of nonlinear equations was proposed
by [13]. Numerical computation results show that the approach has great robust, high convergence rate and precision,
it can give satisfactory solutions of nonlinear equations.

A hybrid approach incorporating an enhanced Nelder-Mead simplex search scheme into a particle swarm optimization
(PSO) with the use of a center particle in a swarm for effectively solving multi-dimensional optimization problems was
proposed by [14]. To show the effectiveness of the proposed approach, 18 benchmark functions were adopted for
optimization via the proposed approach in comparison to existing methods.

A new variation of the particle swarm optimization algorithm basing on group decision (GDPSO) was also proposed by
[15]. The algorithm takes each particle as an individual decision-maker and uses the basic particle information such as
the position of individual history and fitness value to decide a new position. In this way, using the position replaces the

2
 Ovat and Anyandi / Global Journal of Engineering and Technology Advances, 2020, 03(03), 001–006

global best position. So the space of searching is expanded and the population diversity is increased. The GDPSO
algorithm can improve the convergence speed and the capacity of global searching as well as the avoidance of premature
convergence.

The simultaneous perturbation particle swarm optimization which is a combination of the particle swarm optimization
and the simultaneous perturbation optimization method was proposed by [16]. The method has global search capability
of the particle swarm optimization and local search one of gradient method by the simultaneous perturbation.
Comparison between these methods and the ordinary particle swarm optimization were shown through five test
functions and learning problem of neural networks.

A new algorithm for the multimodal function optimization based on the particle swarm optimization (PSO) was
developed by [17]. This method, called the multi-grouped particle swarm optimization (MGPSO), keeps basic concepts
of the PSO, and, thus, shows a more straightforward convergence compared to conventional hybrid type approaches.
The usefulness of the proposed algorithm was verified by the application to various case studies, including a practical
electromagnetic optimization problem.

Due to the slowness and the locality of convergence for Simple Particle Swarm Optimization (PSO) in solving the
complex system optimization, [30], proposed a Two Stage Composite Particle Swarm Optimization (TS-CPSO) as an
improved PSO with the strategy of gradual range contraction. The designing ideas and the implementation of TS-CPSO
were given, and the convergence analysed by simulation. All the results indicate that the new type of algorithm was able
to converge to the global optimal solution and could efficiently avoid the premature phenomenon.

Particle swarm optimization based on chaotic neighbourhood search (PSOCNS) was proposed by [38]. The algorithm
avoids premature convergence by searching each small area which is defined by all particles by chaotic search and then
jumped out of local optimization. The experiment results demonstrate that the PSOCNS proposed is better than the basic
particle swarm optimization algorithm in the aspects of convergence and stability.

Similarly, to prevent that particles of the PSO from easily falling into local optima point in optimization of high-
dimensional and complex functions, [18] proposed a novel two sub-swarms exchange particle swarm optimization
based on multi-phases (TSEM-PSO). The particle swarm was divided into two identical sub-swarms, with the first
adopting the standard PSO model, and the second adopting the proposed model, When the two sub-swarms evolve
steady states independent, the exchange number of particle is different in different searching phase and its amount is
gradually decreasing which can increase the information exchange between the particles, improve the diversity of
population and meliorate the convergence of algorithm. Experiment results show that the TSEM-PSO is superior to
standard PSO and TSE-PSO algorithm.

3. PSO applied to electric power systems

The PSO method has roots in genetic algorithms and evolution strategies, therefore it shares many similarities with
evolutionary computing such as random generation of populations at system initialization or updating generations at
optima search but also differs from it in not using evolution operators such as crossover and mutation or, in that each
particle owns memory. Because of these similarities PSO has, many of the preferable properties of GA and used
successfully in many fields [6]. Expanded PSO method for reactive power and voltage control considering voltage
security assessment was proposed by [19]. Hybrid PSO, evolutionary PSO, and constriction factor to find optimal
mapping between unit load demand and pressure set point in a fossil fuel power unit was used by [21]. A GA hybrid
with PSO to find the optimal design of a plate-fin heat exchanger was applied by [22]. Based on literature PSO has been
found to be robust, flexible, and stable. It is insensitive to local optima or saddle and suitable to solve complex
optimization problems with many parameters. PSO is fast in solving nonlinear, non-differentiable multi-modal
problems and just like GA it does not require gradient computation [1].

4. PSO applied to miscellaneous problems

The PSO method has been applied in the optimal scheduling of hydro system. Here, [24] proposed an enhanced particle
swarm optimization algorithm (EPSO) to solve optimal daily hydro generation scheduling problem. The feasibility and
effectiveness of the proposed EPSO method was demonstrated for optimal daily generation scheduling of a hydro
system and the test results were compared with those of other methods in terms of solution quality and convergence
property. The simulation results showed that the proposed method was able to obtain good solution. The calculation of
critical depth, an essential parameter in hydraulic engineering, in horseshoe cross section open channels, based on PSO

3
 Ovat and Anyandi / Global Journal of Engineering and Technology Advances, 2020, 03(03), 001–006

algorithm was presented by [25]. The consistency of the model was checked through certain examples, numerical
examples demonstrated the capacity, accuracy and simplicity of the present PSO model. The results showed that the
application of their algorithm may be used for solving other similar hydraulic engineering problems and equations like
normal depth. A method for seismic wave impedance inversion in order to improve the fine structure inversion ability
of igneous rocks for the exploration of underlying strata, based on particle swarm optimization (PSO) was developed
by [26]. The results showed that the inversion based on PSO method has a better result for this igneous area. An
application of particle swarm optimization for optimizing the process parameters in turning of PEEK CF30 composites
presented by [27]. The PSO program gives the minimum values of the considered criteria and the corresponding optimal
cutting conditions. A random dimension velocity updated PSO proposed by [40]. Simulations were used to test the
proposed PSO based several benchmark functions and then the proposed PSO was applied to the dynamic economic
dispatch problems of power system. All the simulations prove the efficiency of the proposed method.

5. Modified PSO applications

A novel multi-objective endocrine particle swarm optimization algorithm (MOEPSO) based on the regulation of
endocrine system was proposed by [29]. The results indicate that the designed method is efficient for some multi-
objective optimization problems. A multi-objective optimized support vector machine (SVM) algorithm which is proved
effective for binary-class fingerprint classification was developed by [39]. The results showed that the algorithm can
reduce the work from manual operation for testing suitable parameters of SVM. A new correlated modified particle
swarm optimization (COM-PSO) was developed by [31]. The results of simulations and convergence performance were
compared with the original PSO. The improvement of results, the convergence speed, and the ability to simulate the
correlated phenomena by the proposed COM-PSO were discussed by the experimental results. A new particle swarm
optimization (PSO) that incorporates a hybrid mutation strategy was proposed by [32]. They used the Monte Carlo
method to investigate the behaviour of the particle in PSO. The results revealed the essence of the particle’s trajectory
during executions and the reasons why PSO has relative poor global searching ability especially in the last stage of
evolution. A new particle swarm optimization algorithm (NPSO) for dealing with the portfolio model from stocks market
in which the optimal and sub-optimal positions of each particle were considered in the iteration process, and the
crossover operation is used to avoid premature, this was presented by [33]. The result showed that NPSO outperforms
PSO in algorithm tests, which prevents premature and has better convergence ability. An adapted Particle Swarm
Optimization (PSO) algorithm for the inverse kinematic solution of the robot that is designed for reduction in fracture
treatment with external fixator and it is applied to this robot which has six degrees of freedom was proposed by [34].
The proposed method has been tested on a robot with 3 linear and 3 rotation axes and much better results have been
obtained in comparison with classical PSO. A hybrid improved particle swarm optimization (IPSO) algorithm for the
optimization of hydroelectric power scheduling in multi-reservoir systems, this was proposed by [35]. The scheduling
results of the IPSO algorithm were found to outperform PSO and to be comparable with the results of the dynamic
programming successive approximation algorithm. The immune algorithm-based particle swarm optimization (IA-PSO)
by involving the immune information processing mechanism into the original particle swarm optimal algorithm
proposed and developed by [36]. The result demonstrates that IA-PSO can achieve both a superior load distribution
scheme and a higher convergence precision as compared to PSO, and will hopefully be applied to solving more extensive
optimization problems.

6. Conclusion
Particle swarm optimization is an innovative, collective and distributed intelligent paradigm for solving problems,
mostly in the domain of optimization, without centralized control or the provision of a global model. Several of these
applications and an apt insight into the algorithm operation have been presented. Issues related to premature
convergence around the local minima have been addressed in the light of the reviewed literature. Furthermore,
improvement on the traditional PSO have been reviewed using appropriate literature to give leverage to the algorithm’s
searching capacity.

Compliance with ethical standards

Acknowledgments
Our gratitude goes to the staff of the libraries of the Cross River University of Technology, Calabar and Michael Okpara
University of Agriculture, Umudike, Abia Statefor allowing us use their reserve, main and e-library sections of their
libraries.

4
 Ovat and Anyandi / Global Journal of Engineering and Technology Advances, 2020, 03(03), 001–006

Disclosure of conflict of interest

Both authors declare that there is no conflict of interest.

References
[1] Eberhart RC, Shi Y and Kennedy J. (2001). Swarm Intelligence, Morgan Kaufmann, Burlington, 300-340.
[2] Beni G and Wang J. (1989). Swarm Intelligence, RSJ Press, Tokyo, Japan, 425– 428.
[3] Marini F and Walczak B. (2015). Particle swarm optimization (PSO). A tutorial. Chemometrics and Intelligent
Laboratory Systems, 149, 153–165.
[4] Eberhart R and Kennedy JA. (1995). New Optimizer Using Particle Swarm Theory, Micro Machine and Human
Science, Proceedings of the Sixth International Symposium, Pennsylvania, USA, 1(2), 39 – 43.
[5] Rao SS. (2009). Engineering optimization: theory and practice. John Wiley and Sons, Inc. New York, USA. 290-
350.
[6] Groniewsky A. (2013). Exergoeconomic optimization of a thermal power plant using particle swarm
optimization. Thermal science, 17(2), 509-524.
[7] Mofid GB and Hamed G. (2011). Exergoeconomic optimization of gas turbine plants operating parameters using
genetic algorithms: a case study. Thermal science, 15(3), 43-54.
[8] Liang JJ, Qin AK, Suganthan PN and Baskar S. (2006). Comprehensive learning particle swarm optimizer for global
optimization of multimodal functions. IEEE transactions on evolutionary computation, 10(3), 281-295.
[9] Khare A and Rangnekar S. (2013). A review of particle swarm optimization and its applications in Solar
Photovoltaic system. Applied Soft Computing, 13(5), 2997–3006.
[10] Jiao W, Liu G and Liu D. (2008). Elite Particle Swarm Optimization with mutation. 2008 Asia Simulation
Conference - 7th International Conference on System Simulation and Scientific Computing.
[11] Junliang Li and Xinping Xiao. (2008). Multi- Swarm and Multi- Best particle swarm optimization algorithm. 7th
World Congress on Intelligent Control and Automation.
[12] Junjun Li and Xihuai Wang. (2004). A modified particle swarm optimization algorithm. Fifth World Congress on
Intelligent Control and Automation (IEEE Cat. No.04EX788).
[13] Ouyang A., Zhou Y and Luo Q. (2009). Hybrid particle swarm optimization algorithm for solving systems of
nonlinear equations. IEEE International Conference on Granular Computing.
[14] Hsu C.-C and Gao C.-H. (2008). Particle swarm optimization incorporating simplex search and center particle for
global optimization. IEEE Conference on Soft Computing in Industrial Applications.
[15] Wang L, Cui Z and Zeng J. (2009). Particle Swarm Optimization with Group Decision Making. Ninth International
Conference on Hybrid Intelligent Systems.
[16] Maeda Y, Matsushita N, Miyoshi S and Hikawa H. (2009). On simultaneous perturbation particle swarm
optimization. IEEE Congress on Evolutionary Computation.
[17] Jang-Ho Seo, Chang-Hwan Im, Chang-Geun Heo, Jae-Kwang Kim, Hyun-Kyo Jung and Cheol-Gyun Lee. (2006).
Multimodal function optimization based on particle swarm optimization. IEEE Transactions on Magnetics, 42(4),
1095–1098.
[18] Zhao J, Lü L, Sun H and Zhang X. (2010). A Novel Two Sub-swarms Exchange Particle Swarm Optimization Based
on Multi-phases. IEEE International Conference on Granular Computing.
[19] Yoshida H, Kawata K, Fukuyama Y, Takayama S and Nakanishi Y. (2000). A particle swarm optimization for
reactive power and voltage control considering voltage security assessment, IEEE Transactions on Power
Systems, 15(2), 1232–1239.
[20] Wei Zu, Yan-ling Hao, Hai-tao Zeng and Wen-jing Tang. (2008). Enhancing the particle swarm optimization based
on equilibrium of distribution. Chinese Control and Decision Conference.
[21] Heo JS, Lee KY and Garduno-Ramirez R. (2006). Multiobjective control of power plants using particle swarm
optimization techniques. IEEE Transaction on Energy Conversion, 21(2), 552–561.

5
 Ovat and Anyandi / Global Journal of Engineering and Technology Advances, 2020, 03(03), 001–006

[22] Yousefi M and Darus AN. (2012). Optimal design of plate-fin heat exchangers by a hybrid evolutionary algorithm,
International Communications in Heat and Mass Transfer, 39(2), 258–263.
[23] Shi YH and Eberhart RC. (1998). A Modified Particle Swarm Optimizer, IEEE International Conference on
Evolutionary Computation, Anchorage, Alaska, 1(1) 318–321.
[24] Yuan X, Wang L and Yuan Y. (2009). Application of enhanced PSO approach to optimal scheduling of hydro
system. Energy Conversion and Management, 49(11), 2966–2972.
[25] Bahmanikashkooli A, Zare M, Safarpour B and Safarpour M. (2014). Application of Particle Swarm Optimization
Algorithm for Computing Critical Depth of Horseshoe Cross Section Tunnel. APCBEE Procedia, 9(4), 207–211.
[26] Yang H, Xu Y, Peng G, Yu G, Chen M, Duan W and Wang X. (2017). Particle swarm optimization and its application
to seismic inversion of igneous rocks. International Journal of Mining Science and Technology, 27(2), 349–357.
[27] Hanafi I, Cabrera FM, Dimane F and Manzanares JT. (2016). Application of Particle Swarm Optimization for
Optimizing the Process Parameters in Turning of PEEK CF30 Composites. Procedia Technology, 22(2), 195–202.
[28] Chen D, Zou F and Wang J. (2011). A multi-objective endocrine PSO algorithm and application. Applied Soft
Computing, 11(8), 4508–4520.
[29] Wang RJ, Hong RY, Zhu XX and Zheng K. (2009). Study on two stage composite Particle Swarm Optimization and
its application. International Conference on Machine Learning and Cybernetics.
[30] Arefi A and Haghifam MR. (2011). A modified particle swarm optimization for correlated phenomena. Applied
Soft Computing, 11(8), 4640–4654.
[31] Gao H and Xu W. (2011). Particle swarm algorithm with hybrid mutation strategy. Applied Soft Computing, 11(8),
5129–5142.
[32] He G and Huang N. (2014). A new particle swarm optimization algorithm with an application. Applied
Mathematics and Computation, 232(2), 521–528.
[33] Sancaktar I, Tuna B and Ulutas M. (2018). Inverse kinematics application on medical robot using adapted PSO
method. Engineering Science and Technology, an International Journal, 3(2), 45-55.
[34] Zhang J, Wu Z, Cheng C and Zhang S. (2011). Improved particle swarm optimization algorithm for multi-reservoir
system operation, Water Science and Engineering, 4(1), 61-73.
[35] Li A, Wang L., Li J and Ji C. (2009). Application of immune algorithm-based particle swarm optimization for
optimized load distribution among cascade hydropower stations. Computers & Mathematics with Applications,
57(11), 1785–1791.
[36] Li X, Yu X and Li LD. (2008). Power generation loading optimization using a multi-objective constraint-handling
method via PSO algorithm, Proceedings, 6th IEEE international conference on industrial informatics, Daejeon,
Korea, 1(1), 1632–1637.
[37] Wang W, Wu J-M and Liu J-H. (2009). A Particle Swarm Optimization Based on Chaotic Neighborhood Search to
Avoid Premature Convergence. Third International Conference on Genetic and Evolutionary Computing.
[38] Hsieh CT and Hu CS. (2014). Fingerprint Recognition by Multi-objective Optimization PSO Hybrid with SVM.
Journal of Applied Research and Technology, 12(6), 1014–1024.
[39] Sun Y and Wang Z. (2017). Improved Particle Swarm Optimization Based Dynamic Economic Dispatch of Power
Systems. International Conference on Sustainable Materials Processing and Manufactur ing. Procedia
Manufacturing, 7(2), 297-302.

How to cite this article

Ovat FA and Anyandi AJ. (2020). The particle swarm optimization (PSO) algorithm application – A review. Global Journal
of Engineering and Technology Advances, 3(3), 01-06.