scholarly journals Sequential network‐flow based power‐flow method for hybrid power systems

Author(s):  
Ayman M.O. Mohamed ◽  
Ramadan El‐Shatshat
Author(s):  
Miguel Jimenez Carrizosa ◽  
Eduardo Jimenez ◽  
Amir Arzande

2013 ◽  
Vol 7 (4) ◽  
pp. 191-200 ◽  
Author(s):  
Emad Maher Natsheh ◽  
Abdel Razzak Natsheh ◽  
Alhussein Albarbar

Author(s):  
Michel Duran-Quintero ◽  
John E. Candelo ◽  
Jose Soto-Ortiz

<span lang="EN-US">A three-phase unbalanced power flow method can provide a more realistic scenario of how distribution networks operate. The backward/forward sweep-based power flow method </span><span lang="EN-AU">(BF-PF)</span><span lang="EN-US"> has been used for many years as an important computational tool to solve the power flow for unbalanced and radial power systems. However, some of the </span><span lang="EN-AU">few </span><span lang="EN-US">available research tools produce many errors when </span><span lang="EN-AU">they </span><span lang="EN-US">are used for </span><span lang="EN-AU">network </span><span lang="EN-US">reconfiguration </span><span lang="EN-AU">because the </span><span lang="EN-US">topology change</span><span lang="EN-AU">s</span><span lang="EN-AU">after multiple switch actions</span><span lang="EN-US"> and the nodes are disorganized continually. </span><span lang="EN-AU">T</span><span lang="EN-US">his paper presents </span><span lang="EN-AU">a modified</span><span lang="EN-AU">BF-PF for </span><span lang="EN-US">three-phase unbalanced radial </span><span lang="EN-AU">distribution networks</span><span lang="EN-US"> that is capable </span><span lang="EN-AU">of arranging</span><span lang="EN-US"> the system topology when reconfiguration changes the branch connections. A binary search is used to determine the connections between nodes, allowing the algorithm to avoid those problems when reconfiguration is carried out, regardless of node numbers. Tests are made to verify the usefulness of the proposed algorithm in both the IEEE 13-node test feeder and the 123-node test feeder, converging in every run where constraints are accomplished. This approach can be used easily for a large-scale feeder network reconfiguration.</span><span lang="EN-AU"> The full version of this modified </span><span lang="EN-US">backward/forward sweep</span><span lang="EN-AU"> algorithm is available for research at MathWorks</span><span lang="EN-US">.</span>


Sign in / Sign up

Export Citation Format

Share Document