Open AccessIdentification of Optimal Path in Power System Network Using Bellman Ford Algorithm
Author(s) -
S. Hemalatha,
P. Valsalal
Publication year - 2012
Publication title -
modelling and simulation in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.264
H-Index - 20
eISSN - 1687-5591
pISSN - 1687-5605
DOI - 10.1155/2012/913485
Subject(s) - blackout , path (computing) , mathematical optimization , control reconfiguration , electric power system , shortest path problem , computer science , power (physics) , constrained shortest path first , transmission (telecommunications) , mathematics , telecommunications , k shortest path routing , computer network , graph , physics , theoretical computer science , quantum mechanics , embedded system
Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses), capacity of the transmission line, voltage stability, priority of loads, and power balance between the generation and demand. In this paper, the Bellman Ford Algorithm (BFA) is applied to find out the optimal path and also the several alternative paths by considering all the constraints. In order to demonstrate the capability of BFA, it has been applied to a practical 230 kV network. This restorative path search guidance tool is quite efficient in finding the optimal and also the alternate paths for transmitting the power from a generating station to demand
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom