Integration of Genetic and Dijkstra's Algorithm for Optimal Over-Current Relay Coordination in Power Distribution System

Protective relaying systems are essential for quickly identifying and isolating faults in order to minimize equipment damage and avert extensive outages. Different coordination schemes of over-current relays such as linear programming, simplex, dual simplex, two-phase simplex and intelligent optimization approaches have been implemented in power systems to minimize the effect of faults. This paper suggests a new protection strategy that offers fault clearing path selection and Over Current relay (OCR) coordination by integrating Dijkstra Algorithm (DA) and Genetic Algorithm (GA). The main objective is to ensure proper coordination of OCR in complex power systems and to activate the relay setting along the shortest path. The GA identifies optimal relay coordination setting for OCR efficiently to ensure fast fault detection. On the other hand, the DA determines the shortest path and optimal time grading for OCR based on their location within the network system for faster fault isolation by choosing the shortest path from the fault location. The goal of integrating these algorithms is to improve the efficiency, selectivity, and dependability of the system. The suggested protection method is successful in reducing errors and limiting downtime, as shown by simulation tests. The results and comparative analysis demonstrate how sophisticated computational methods may be used to increase the stability and resilience of contemporary power systems through system modeling, data collection, and the amalgamation of optimization algorithms.