Abstract—A graph theory based methodology called Dijkstra’s algorithm is used to find the energizing path of power to flow for a given network after a complete blackout is proposed here. Whenever a blackout occurs in the transmission network, the power system operators are under immense pressure to restore the network. The main aim of the power system restoration is to restore as much load as possible and as quickly as possible. After a blackout occurs first all the generators has to be energized and then synchronized. After synchronization of generators only all the loads can be supplied. For energizing the generators a sequential procedure has to be followed. If the sequence used is wrong then it may lead to cascaded outages. The Dijkstra’s algorithm helps in finding the sequence to energize the generators based on least impedance path called minimum spanning tree. Newton Raphson based load flow technique is applied to this resultant minimum spanning tree (power flow path). Based on the results (voltage, current and power flow) obtained from the load flow solutions, other constraints of the restoration problem are applied.

 

Index Terms—graph theory, blackout, minimum spanning tree, load flow solution

Cite: G. Naveen and A. A. Jain, "Simulation of Blackout Recovery in Transmission Side Using N-R Method," International Journal of Electronics and Electrical Engineering, Vol. 3, No. 5, pp. 354-358, October 2015. doi: 10.12720/ijeee.3.5.354-358