TY  - JOUR
T1  - Dijkstra’s Algorithm for Shortest Path Identification in Reconfigurable Microgrid
AU - Swathika, O.V. Gnana AU - Arya, Rishab AU - Yadav, Rishabh AU - Agarwal, Raghav 
JO  - Journal of Engineering and Applied Sciences
VL  - 13
IS  - 3
SP  - 717
EP  - 720
PY  - 2018
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2018.717.720
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2018.717.720
KW  - Hybrid algorithm
KW  -microgrid protection
KW  -Dijkstras algorithm
KW  -microgrid
KW  -frequently
KW  -validated
AB  - Microgrids are local distribution level networks which operate in either grid connected mode or
islanded mode. It is a flexible system which supports the integration of renewable power sources such as solar,
wind, etc. Reconfiguration of the microgrid occurs frequently. Due to the bidirectional power flow, traditional
protection methods are not applicable to microgrids. This study discusses the use of Hybrid-Dijkstra’s
algorithm which finds out the shortest path from a faulted point to the nearest operating source which may lead
to minimum user disconnection. The proposed algorithm is tested and validated on a standard 43-bus microgrid
network and an IEEE 7-bus distribution network.
ER  -