A Fine-Grained Parallel Power Flow Method for Large Scale Grid Based on Lightweight GPU Threads

Author(s):  
Han Jiang ◽  
Deyang Chen ◽  
Yalou Li ◽  
Ran Zheng
2012 ◽  
Vol 433-440 ◽  
pp. 1085-1091
Author(s):  
Ming Hai Yang ◽  
Chun Xiao Liu ◽  
Cheng Shan Wang ◽  
Wei Wei

Voltage stability of power grid would be affected greatly by the connection of large-scale wind farms. Conventional continuous power flow method can not accurately simulate the system’s operation when wind farms are connected to power gird. A new continuous power flow method is proposed, considering auto-disconnection of large-scale wind farms. The step-size control segment is improved in this algorithm in order to simulate the operation characteristics of wind farm and determine the precise time when a certain wind farm is cut off.


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>


2018 ◽  
Vol 7 (4) ◽  
pp. 56-67
Author(s):  
Hiba Yahyaoui ◽  
Abdelkader Dekdouk ◽  
Saoussen Krichen

This article addresses the distribution network reconfiguration problem (DNRP) and the power flow method. The studied DNRP operates on standard configurations of electrical networks. The main objectives handled are the minimization of power loss, the number of switching operations and the deviations of bus voltages from their rated values. Metaheuristic approaches based on Greedy Iterated Local Search where proposed to solve the DNRP. A benchmarking testbed on standard systems well illustrates the incentive behind using GrILS for solving the DNRP. In addition, the proposed approaches and the power flow method where implemented on GPU architecture. The GPU implementation shows its effectiveness against the CPU in terms of time consuming specially for large-scale bus systems.


Sign in / Sign up

Export Citation Format

Share Document