Fault location algorithm based on shortest path optimization problem for Distribution networks with DG

This paper explores the design of a fault location algorithm for Distribution systems with Distributed Generation (DG). It considers fault location requirements for this type of power systems, DG impact, methodologies proposed by other authors and incremental testing. This work achieves the development of a versatile and adaptive algorithm that works effectively under conditions and impacts caused by DG connection, scenario that affects traditional fault location algorithms. The proposed algorithm bases its search on shortest path optimization problem, applying Dijkstra´s Algorithm, to identify nodes with high correlation with faults. The algorithm found fault zones accurately for any type of fault. Its performance was tested and validated on radial distribution systems with DG penetration using real time simulation.