Effects of Particle Swarm Optimization and Genetic Algorithm Control Parameters on Overcurrent Relay Selectivity and Speed

Abstract

Distribution systems continue to grow and becoming more complex with increasing operational challenges such as protection miscoordination. Initially, conventional methods were favoured to solve overcurrent relay coordination problems; however, the implementation of these methods is time-consuming. Therefore, recent studies have adopted the utilisation of particle swarm optimization and genetic algorithms to solve overcurrent relay coordination problems and maximise system selectivity and operational speed. Particle swarm optimization and genetic algorithms are evolutionary algorithms that at times suffer from premature convergence due to poor selection of control parameters. Consequently, this paper presents a comprehensive sensitivity analysis to evaluate the effect of the discrete control parameters on particle swarm optimizer and genetic algorithms performance, alternatively on the behaviour of overcurrent relays. Optimization algorithms aim to minimise overcurrent relay time multiplier settings and accomplish optimal protection coordination. The findings indicate that particle swarm optimization is more sensitive to inertia weight and swarm size while the number of iterations has minimal effect. The results also depict that 30% crossover, 2% mutation, and smaller population size yield faster convergence rate and optimise fitness function, which improves genetic algorithms performance. Sensitivity analysis results are verified by comparing the performance of particle swarm optimization with the genetic algorithms which show the former parameter setting outperforms the latter. The relay operational speed is reduced by 15% for particle swarm optimization and system selectivity is maximised. The optimal protection coordination achieved using particle swarm optimization showed superiority of the algorithm, its ability to circumvent premature convergence, consistency, and efficiency.

A Denoising Method for Mining Cable PD Signal Based on Genetic Algorithm Optimization of VMD and Wavelet Threshold

“…The genetic algorithm is an optimization algorithm that simulates the natural selection and genetic evolution of organisms [ 17 , 18 , 19 ]. It usually includes three genetic operators: selection, crossover and mutation.…”

A Twinning Memory Bare-Bones Particle Swarm Optimization Algorithm for No-Linear Functions

“…The PSO has remarkable advantages in solving non-linear transient problems and there are several important areas where these derivative methods have made a majority contribution, like parameter magnet [7], [8], parameter identification [9], path planning [10] [11], large scale optimization [12], process synthesis [13], community detection [14], feature selection [15], risk prediction [16], biomass power plant [17] and financial management [18] In 2015, Li [19] proposed the HMPSO based on the historical memory of the particle, which uses a distribution estimation algorithm to estimate and preserve information about the distribution of the historical promising personal best position of the particle. The best position of the particle is selected from three candidate positions, generated from the historical memory, the particles' current personal best position, and the swarm's global best position.…”

A Bare-Bones Particle Swarm Optimization With Crossed Memory for Global Optimization

“…Record the Gbest_position, for the (gen)th memory 5: end for 6: it = 0, it stands for the iteration times management [19], parameter magnet [20], path planning [21], process synthesis [22], feature selection [23], [24], [25], parameter identification [26], muti-objective problems [27], [28], [29], and so on.…”