scholarly journals Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

2012 ◽  
Vol 2012 ◽  
pp. 1-6 ◽  
Author(s):  
S. Hemalatha ◽  
P. Valsalal
Keyword(s):  
Power System ◽  
Transmission Line ◽  
Shortest Path ◽  
Voltage Stability ◽  
Optimal Path ◽  
Power Balance ◽  
Line Voltage ◽  
System Components ◽  
Path Search ◽  
Search Guidance

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.

scholarly journals Network Structure-Based Critical Bus Identification for Power System Considering Line Voltage Stability Margin

2018 ◽  
Vol 06 (09) ◽  
pp. 97-111 ◽  
Author(s):  
Oludamilare Bode Adewuyi ◽  
Mir Sayed Shah Danish ◽  
Abdul Motin Howlader ◽  
Tomonobu Senjyu ◽  
Mohammed E. Lotfy
Keyword(s):  
Power System ◽  
Network Structure ◽  
Voltage Stability ◽  
Stability Margin ◽  
Line Voltage ◽  
Voltage Stability Margin

scholarly journals Comparative Analysis of Optimal Path Search Algorithms

2020 ◽  
Vol 6 (12) ◽  
pp. 248-255
Author(s):  
A. Sultanova
Keyword(s):  
Comparative Analysis ◽  
Shortest Path ◽  
Mobile Robotics ◽  
Optimal Path ◽  
Search Algorithms ◽  
Traffic Planning ◽  
Level System ◽  
Dijkstra Algorithm ◽  
Path Search ◽  
Grid Algorithms

This article discusses widely used algorithms for finding optimal paths. Currently, there is a fairly wide list of algorithms for the problem of finding the shortest path, and is actively used in mobile robotics to find the optimal route. The article offers a two-level system that performs traffic planning. Comparative analysis of various search methods was carried out: their length, complexity, and a number of turning points. The purpose of the article is to study and compare algorithms from the field of artificial intelligence for finding the shortest path in a maze and a hexagonal grid. Algorithms under study: A* (star), Dijkstra algorithm, BFS, DFS, and Greedy algorithm. Algorithms are compared based on two criteria: the length of the found path and the time it takes to find the path. The results, presented analytically and graphically, show the application of five algorithms for mazes with different size and number of obstacles.

Sign in / Sign up

Export Citation Format

Share Document