Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
Microgrid plays an efficient and necessary role in consumer provision of reliable power supply by alleviating grid disturbances to boost grid resilience. In addition, to utility grid which is the main source of power supply, integration of growing employment of renewable energy sources such as solar and wind into the microgrids support a flexible and efficient electric grid. The conventional approach to designing a protective scheme may not be applicable for fault clearance in a dynamic microgrid. In this study, reverse delete algorithm aided Dijkstra’s algorithm is proposed to recognize the shortest path to clear the fault from a faulted point to the utility grid or point of common coupling. The reverse delete algorithm is utilized to find the list of active nodes in the microgrid network. Whenever, a fault occurs in the microgrid, the Djikstra’s algorithm is employed on the list of active nodes to identify the shortest path to clear the fault in the network. The proposed algorithm is tested on a standard129-bus microgrid test system.
How to cite this article:
O.V. Gnana Swathika, Nikhil Nambiar Ashish Pati, Raja Manish and S. Hemamalini. Reverse Delete Aided Dijkstra’s Algorithm for Shortest Path Identification in Microgrids.
DOI: https://doi.org/10.36478/jeasci.2016.2238.2241
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2016.2238.2241