Header menu link for other important links
X
Shortest Path Identification in Reconfigurable Microgrid Using Hybrid Bellman Ford-Dijkstra’s Algorithm
, , Mishra S, Pophali S.M, Barve N.A.
Published in American Scientific Publishers
2016
Volume: 22
   
Issue: 10
Pages: 2932 - 2935
Abstract
Microgrid caters to the growing power demand in the distribution network. Due to reconfiguration of microgrid, conventional protection schemes are not suitable for fault clearance. This paper proposes a communication assisted central protection system (CPS), which monitors the microgrid. The active nodes of the network are populated using Bellman Ford algorithm. In the event of fault, the Dijkstras algorithm is employed on the current topology of network, to identify the shortest path from the faulted point to the point of common coupling. This hybrid algorithm ensures that during fault clearance, minimum portion of network disconnection occurs. The algorithm is tested and validated on 40-bus and 54-bus microgrid network. © 2016 American Scientific Publishers. All rights reserved.
About the journal
JournalData powered by TypesetAdvanced Science Letters
PublisherData powered by TypesetAmerican Scientific Publishers
ISSN1936-6612
Open Access0