Development of combined Runge–Kutta Broyden's load flow approach for well‐ and ill‐conditioned power systems

Tostado‐Véliz, Marcos; Kamel, Salah; Jurado, Francisco

doi:10.1049/iet-gtd.2018.5633

Cited by 24 publications

(15 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the factorization of the Jacobian matrix could be considered the heaviest computational part of a PF solver [10], one could deduce that the technique developed in [10] is four-times less efficient than NR. To address such issue, the authors developed a combined Runge-Kutta-Broyden paradigm in [20], which avoids the factorization of the Jacobian matrix. However, this calculation is replaced by the inversion of the Jacobian, which is unaffordable in large-scale systems.…”

Section: Literature Reviewmentioning

confidence: 99%

On the Applicability of Two Families of Cubic Techniques for Power Flow Analysis

2021

Self Cite

View full text Add to dashboard Cite

This work presents a comprehensive analysis of two cubic techniques for Power Flow (PF) studies. In this regard, the families of Weerakoon-like and Darvishi-like techniques are considered. Several theoretical findings are presented and posteriorly confirmed by multiple numerical results. Based on the obtained results, the Weerakoon’s technique is considered more reliable than the Newton-Raphson and Darvishi’s methods. As counterpart, it presents a high computational burden. Regarding this point, the Darvishi’s technique has turned out to be quite efficient and fully competitive with the Newton’s scheme.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

On the Applicability of Two Families of Cubic Techniques for Power Flow Analysis

2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…On the basis of this analogy, any numerical integration method can be considered for developing robust PF solution techniques. The authors have exploited this idea in several references [13]- [15]. In addition, the Implicit counterpart of the Continuous Newton's method has been proposed for PF analysis in [16].…”

Section: B Literature Reviewmentioning

confidence: 99%

A Three-Stage Algorithm Based on a Semi-Implicit Approach for Solving the Power-Flow in Realistic Large-Scale ill-Conditioned Systems

2020

Self Cite

View full text Add to dashboard Cite

Solving the Power-Flow in realistic large-scale ill-conditioned systems supposes a challenging task for most of available solution methodologies. This paper tackles this issue by developing a novel efficient and robust Power-Flow method. It is mainly based on a Semi-Implicit approach but incorporates other numerical arrangements for enhancing its features. The resulting three-stage algorithm is validated using several realistic ill-conditioned systems ranging from 3012 to 70000-buses. Results show that the developed methodology constitutes an efficient and robust Power-Flow solution technique, outperforming the results obtained with other available approaches. INDEX TERMS Power-flow, ill-conditioned cases, semi-implicit approach, regularization. I. INTRODUCTION A. MOTIVATION

show abstract

“…). Algorithm 2 is well-defined and, for any starting point 0 ∈ Ω, it either terminates finitely with an iterate k satisfying 0 ∈ m( k ) + N Ω ( k ) or generates an infinite sequence { k } and any accumulation point ⋆ of this sequence satisfies (12). Additionally, if { k } is a subsequence of { k } converging to ⋆ , then Δ( k ) → 0 as k → ∞.…”

Section: Theorem 1 ([22]mentioning

confidence: 99%

A novel MILP‐Newton approach for power flow analysis

Silva

Júnior

Costa

2020

IET Generation Trans & Dist

View full text Add to dashboard Cite

This paper presents a novel mixed integer linear programming-Newton approach for solving constrained AC power flow problems, based on a recently proposed linear programing-Newton method. The linear programming-Newton method overcomes some deficiencies of the classical Newton's method, while retaining its quadratic convergence in the neighbourhood of a solution. The discrete nature of some control variables, such as transformer tap ratios and bus shunt susceptances, are often ignored in power flow algorithms due to difficulties that they introduce. The violation of operational limits in power flow algorithms is typically corrected in ex-post procedures, such as PV-PQ bus switching, which may lead to infeasibilities. Finally, under some circumstances, power flow problems may not have a solution; in these cases, a desirable property of a power flow algorithm would be the ability to obtain a nearly feasible solution. The approach proposed in this paper handles these difficulties in a unified framework and is able to deal directly with discrete variables and operational limits. When there are no power flow solutions, a nearly feasible solution that minimizes a merit function is obtained. Numerical experiments show that the proposed approach is robust and obtains accurate solutions in the presence of discreteness conditions and operational limits. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Development of combined Runge–Kutta Broyden's load flow approach for well‐ and ill‐conditioned power systems

Cited by 24 publications

References 31 publications

On the Applicability of Two Families of Cubic Techniques for Power Flow Analysis

On the Applicability of Two Families of Cubic Techniques for Power Flow Analysis

A Three-Stage Algorithm Based on a Semi-Implicit Approach for Solving the Power-Flow in Realistic Large-Scale ill-Conditioned Systems

A novel MILP‐Newton approach for power flow analysis

Contact Info

Product

Resources

About