4.6 Article

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

期刊

IEEE ACCESS
卷 10, 期 -, 页码 4550-4567

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2022.3140679

关键词

Relays; Genetic algorithms; Particle swarm optimization; Convergence; Circuit faults; Sensitivity analysis; Statistics; Control parameter; genetic algorithms; overcurrent relay; particle swarm optimization; power system protection; protection coordination; selectivity; speed

向作者/读者索取更多资源

This paper presents a comprehensive sensitivity analysis to evaluate the effect of control parameters on the performance of particle swarm optimization and genetic algorithms in solving overcurrent relay coordination problems. The findings show that particle swarm optimization is more sensitive to inertia weight and swarm size, and appropriate parameter settings can improve its performance.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据