regarding the large number of developed particle swarm optimization (pso) algorithms and the various applications for which pso has been used, selecting the most suitable variant of pso for solving a particular optimization problem is a challenge for most researchers. in this paper, using a comprehensive survey and taxonomy on different types of pso, an expert system (es) is designed to identif...

numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of multi-objective optimization (moo) had arisen several years ago. due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by swarm intelligence (si) techniques. particle swarm optimization (pso) has ...

In order to improve the performance of PSO algorithm, number of its variants has been made. This paper presents detail overview of the basic concepts of PSO and its variants. Many variants of PSO have been developed due to improved speed of convergence and quality of solution found by Researchers. The Applications of PSO in Complex Environments is discussed. Modifications, both those already de...

Adaptive Particle Swarm Optimization (PSO) variants have become popular in recent years. The main idea of these adaptive PSO variants is that they adaptively change their search behavior during the optimization process based on information gathered during the run. Adaptive PSO variants have shown to be able to solve a wide range of difficult optimization problems efficiently and effectively. In...

Linear decreasing inertia weight (LDIW) strategy was introduced to improve on the performance of the original particle swarm optimization (PSO). However, linear decreasing inertia weight PSO (LDIW-PSO) algorithm is known to have the shortcoming of premature convergence in solving complex (multipeak) optimization problems due to lack of enough momentum for particles to do exploitation as the alg...

This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. In the new algorithm, each particle is attracted towards the best previous positions visited by its neighbors, in addition to the other aspects of particle dynamics in PSO. This is accomplished by using the ratio of t...

We introduce a high-performing composite particle swarm optimization (PSO) algorithm. In an analogy to the popular character of Mary Shelley’s famous novel, we call our algorithm Frankenstein’s PSO, as it consists of different algorithmic components drawn from other PSO variants. Frankenstein’s PSO constituents were selected after careful evaluation of their impact on speed and reliability. We ...

In this paper, the behavior of different Particle Swarm Optimization (PSO) variants is analyzed when solving a set of well-known numerical constrained optimization problems. After identifying the most competitive one, some improvements are proposed to this variant regarding the parameter control and the constraint-handling mechanism. Furthermore, the on-line behavior of the improved PSO and som...

This chapter presents a study about the behavior of Particle Swarm Optimization (PSO) in constrained search spaces. A comparison of four well-known PSO variants used to solve a set of test problems is presented. Based on the information obtained, the most competitive PSO variant is detected. From this preliminary analysis, the performance of this variant is improved with two simple modification...

This paper benchmarks the performance of one of the recent research directions in the performance improvement of particle swarm optimization algorithm; human learning principles inspired PSO variants. This article discusses and provides performance comparison of nine different PSO variants. The Comparing Continuous Optimizers (COCO) methodology has been adopted in comparing these variants on th...