Application of the Graph Theory in Managing Power Flows in Future Electric Networks

Abstract

This chapter has presented an application of the graph theory in power systems for the function of power routing. The performance of the power routing function using Successive Shortest Path (SSP) and Scaling Push Relabel (SPR) algorithms are investigated on a simulation of a radial network. Simulation results show that the algorithm has self- stabilizing and self-healing properties in response to changes in the cost and capacity for power demand/supply. Simulations reveal also the ability of the power routing function to deal with issues of network variations and constraints. Moreover, the function can be implemented in an online, real-time environment which is emerging in the development of the future power systems. 8.