A Novel Adaptive Elite‐Based Particle Swarm Optimization Applied to VAR Optimization in Electric Power Systems

Abstract

Particle swarm optimization (PSO) has been successfully applied to solve many practical engineering problems. However, more efficient strategies are needed to coordinate global and local searches in the solution space when the studied problem is extremely nonlinear and highly dimensional. This work proposes a novel adaptive elite-based PSO approach. The adaptive elite strategies involve the following two tasks: (1) appending the mean search to the original approach and (2) pruning/cloning particles. The mean search, leading to stable convergence, helps the iterative process coordinate between the global and local searches. The mean of the particles and standard deviation of the distances between pairs of particles are utilized to prune distant particles. The best particle is cloned and it replaces the pruned distant particles in the elite strategy. To evaluate the performance and generality of the proposed method, four benchmark functions were tested by traditional PSO, chaotic PSO, differential evolution, and genetic algorithm. Finally, a realistic loss minimization problem in an electric power system is studied to show the robustness of the proposed method.

Induction motor bearing fault classification using deep neural network with particle swarm optimization‐extreme gradient boosting

“…The vectors $${X}_{p}^{t}$$ and $${v}_{p}^{t+1}$$ denote the position and velocity, respectively, of each particle p in a population residing within a limited search space. The inertia w plays a crucial role in the algorithm as it determines how the previously updated features are incorporated into the next iteration to influence convergence [30, 31]. The constants C 1 and C 2 are referred to as acceleration coefficients [32], while $${r}_{1}^{t}$$ and $${r}_{2}^{t}$$ represent random numbers ranging from 0 to 1.…”

A Chaos-Enhanced Particle Swarm Optimization with Adaptive Parameters and Its Application in Maximum Power Point Tracking

“…The particle swarm optimization was developed to optimally search for the local best and the global best; these searches are frequently known as the exploitation and exploration of the problem space, respectively. Hong et al [21] stated that exploitation involves an intense search of particles in a local region while exploration is a long term search, whose main objective is to find the global optimum of the fitness function. Although particle swarm optimization rapidly searches the solution of many complex optimization problems, it suffers from premature convergence, trapping at a local minimum, the slowing down of convergence near the global optimum, and stagnation in a particular region of the problem space especially in a multimodal functions and high-dimensional problem space.…”