.png){kind=icon}
.png){kind=icon}
Return
Fault Location Method for Distribution Networks Based on Cluster Partitioning and Arithmetic Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.3390/pr14030493.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The large-scale integration of Distributed Generators (DGs) has significantly altered fault characteristics in distribution networks, posing challenges to conventional fault location methods. To address these limitations, this paper presents a novel approach that combines dynamic cluster partitioning with the arithmetic optimization algorithm (AOA). The proposed method first divides the network into autonomous clusters based on electrical coupling, facilitating preliminary fault area identification. Subsequently, the AOA optimizes fault section identification through current matching analysis. Using MATLAB simulations on an IEEE 33-node system with various DG types and fault scenarios, the method demonstrates superior accuracy and faster convergence compared to traditional approaches. Results confirm its effectiveness in improving fault location performance for modern distribution networks with high DG penetration.
Keywords:
distributed generation
cluster partitioning
fault location
arithmetic optimization algorithm
Journal
IF:
2.8
Papers:
6.7K
Citations:
3.7W