The algorithm ensures minimum portion of network disconnection for fault isolation. The proposed algorithm is tested and validated on an IEEE 21-bus microgrid network in islanded mode and an IEEE 69-bus distrib
For a polygon with more than three edges, such as are produced by clipping a triangle, a convex combination of the values of the datum at the polygon’s vertices must: be used to obtain the value assigned to each fragment produced by the rasterization algorithm. That is, it mu...
Procedure MSTPrim(Graph, source): for each u in V key[u] := inf parent[u] := NULL end for key[source] := 0 Q = Priority_Queue() Q = V while Q is not empty u -> Q.pop for each v adjacent to i if v belongs to Q and Edge(u,v) < key[v] // here Edge(u, v) re...
This paper proposes hybrid Prims-Johnson's algorithm, which aids in identifying the shortest path from a faulted point to the point of common coupling. This algorithm ensures that only minimum portion of network is disconnected during fault clearance. The proposed algorithm is tested and validated ...
Kousaka, I., Eguchi, D., Yamashita, D., Nakanishi, Y., Yokoyama, R., Iba, K.: Cost-minimum network planning in large wind farm using revised prim's algorithm. In: Proc.IEEE Innovative Smart Grid Technologies Conference (ISGT). pp. 1-6. Washington, DC, USA (19-22 February 2014)...