Back to Search
Start Over
Effects of Particle Swarm Optimization and Genetic Algorithm Control Parameters on Overcurrent Relay Selectivity and Speed
- Source :
- IEEE Access, Vol 10, Pp 4550-4567 (2022)
- Publication Year :
- 2022
- Publisher :
- IEEE, 2022.
-
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.
Details
- Language :
- English
- ISSN :
- 21693536
- Volume :
- 10
- Database :
- Directory of Open Access Journals
- Journal :
- IEEE Access
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.04b6923922fc4d7ca876fb984540b5c1
- Document Type :
- article
- Full Text :
- https://doi.org/10.1109/ACCESS.2022.3140679