Anderson-Acceleration-Based Power Flow Method for Integrated Transmission and Distribution Networks

Author(s):  
Yifeng Chen ◽  
Kunjie Tang ◽  
Hangyin Mao ◽  
Shufeng Dong
Computation ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 61
Author(s):  
Oscar Danilo Montoya ◽  
Juan S. Giraldo ◽  
Luis Fernando Grisales-Noreña ◽  
Harold R. Chamorro ◽  
Lazaro Alvarado-Barrios

The power flow problem in three-phase unbalanced distribution networks is addressed in this research using a derivative-free numerical method based on the upper-triangular matrix. The upper-triangular matrix is obtained from the topological connection among nodes of the network (i.e., through a graph-based method). The main advantage of the proposed three-phase power flow method is the possibility of working with single-, two-, and three-phase loads, including Δ- and Y-connections. The Banach fixed-point theorem for loads with Y-connection helps ensure the convergence of the upper-triangular power flow method based an impedance-like equivalent matrix. Numerical results in three-phase systems with 8, 25, and 37 nodes demonstrate the effectiveness and computational efficiency of the proposed three-phase power flow formulation compared to the classical three-phase backward/forward method and the implementation of the power flow problem in the DigSILENT software. Comparisons with the backward/forward method demonstrate that the proposed approach is 47.01%, 47.98%, and 36.96% faster in terms of processing times by employing the same number of iterations as when evaluated in the 8-, 25-, and 37-bus systems, respectively. An application of the Chu-Beasley genetic algorithm using a leader–follower optimization approach is applied to the phase-balancing problem utilizing the proposed power flow in the follower stage. Numerical results present optimal solutions with processing times lower than 5 s, which confirms its applicability in large-scale optimization problems employing embedding master–slave optimization structures.


2021 ◽  
Vol 11 (23) ◽  
pp. 11525
Author(s):  
Oscar Danilo Montoya ◽  
Luis Fernando Grisales-Noreña ◽  
Lázaro Alvarado-Barrios ◽  
Andres Arias-Londoño ◽  
Cesar Álvarez-Arroyo

This research addresses the problem of the optimal placement and sizing of (PV) sources in medium voltage distribution grids through the application of the recently developed Newton metaheuristic optimization algorithm (NMA). The studied problem is formulated through a mixed-integer nonlinear programming model where the binary variables regard the installation of a PV source in a particular node, and the continuous variables are associated with power generations as well as the voltage magnitudes and angles, among others. To improve the performance of the NMA, we propose the implementation of a discrete–continuous codification where the discrete component deals with the location problem and the continuous component works with the sizing problem of the PV sources. The main advantage of the NMA is that it works based on the first and second derivatives of the fitness function considering an evolution formula that contains its current solution (xit) and the best current solution (xbest), where the former one allows location exploitation and the latter allows the global exploration of the solution space. To evaluate the fitness function and its derivatives, the successive approximation power flow method was implemented, which became the proposed solution strategy in a master–slave optimizer, where the master stage is governed by the NMA and the slave stage corresponds to the power flow method. Numerical results in the IEEE 34- and IEEE 85-bus systems show the effectiveness of the proposed optimization approach to minimize the total annual operative costs of the network when compared to the classical Chu and Beasley genetic algorithm and the MINLP solvers available in the general algebraic modeling system with reductions of 26.89% and 27.60% for each test feeder with respect to the benchmark cases.


2021 ◽  
Vol 196 ◽  
pp. 107215
Author(s):  
Renan K. Portelinha ◽  
Carolina C. Durce ◽  
Odilon L. Tortelli ◽  
Elizete M. Lourenço

Energies ◽  
2019 ◽  
Vol 12 (21) ◽  
pp. 4078 ◽  
Author(s):  
Baljinnyam Sereeter ◽  
Werner van Westering ◽  
Cornelis Vuik ◽  
Cees Witteveen

In this paper, we propose a fast linear power flow method using a constant impedance load model to simulate both the entire Low Voltage (LV) and Medium Voltage (MV) networks in a single simulation. Accuracy and efficiency of this linear approach are validated by comparing it with the Newton power flow algorithm and a commercial network design tool Vision on various distribution networks including real network data. Results show that our method can be as accurate as classical Nonlinear Power Flow (NPF) methods using a constant power load model and additionally, it is much faster than NPF computations. In our research, it is shown that voltage problems can be identified more efficiently when MV and LV are integrally evaluated. Moreover, Numerical Analysis (NA) techniques are applied to the Large Linear Power Flow (LLPF) problem with 27 million nonzeros in order to improve the computation time by studying the properties of the linear system. Finally, the original computation times of LLPF problems with real and complex components are reduced by 2.8 times and 5.7 times, respectively.


2015 ◽  
Vol 6 (3) ◽  
pp. 1484-1492 ◽  
Author(s):  
Hongbin Sun ◽  
Qinglai Guo ◽  
Boming Zhang ◽  
Ye Guo ◽  
Zhengshuo Li ◽  
...  

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