A Sparse Tableau Formulation for Node-Breaker Representations in Security-Constrained Optimal Power Flow

Park, Byungkwon; Holzer, Jesse; DeMarco, Christopher L.

doi:10.1109/tpwrs.2018.2869705

Cited by 22 publications

(15 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As was observed in [21], which solved an OPF with all lines linearized, the problem is solved faster only for highly stressed systems; on average, the linearization slows down the solution process. Furthermore, convergence issues were observed in our simulations when linearizing too many lines, attributed to the voltage control constraints, ( 17)- (18), "clashing" with the large number of introduced voltage-angle constraints (see [21]). As such, only a percentage of power flows can be linearized, in order to avoid such cases.…”

Section: B Performance Of Proposed Techniquesmentioning

confidence: 91%

“…1). b) Constraint set ( 16) is replaced by ( 17)- (18). c) Partial CC slack variables removal (Section III.A).…”

Section: Iterative Solution Algorithmmentioning

confidence: 99%

“…With SCOPF recently gaining some research momentum, on top of "conventional" approaches, new and highly specialized methods and problem formulations have been proposed within its scope, such as the sparse tableau representation of node breakers [18] or the cross-entropy method [19]. However, their validation and full potential have not been widely explored.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Novel Approximation of Security-Constrained Optimal Power Flow With Incorporation of Generator Frequency and Voltage Control Response

Avramidis

Capitanescu

Karagiannopoulos³

et al. 2021

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

Section: B Performance Of Proposed Techniquesmentioning

confidence: 91%

“…1). b) Constraint set ( 16) is replaced by ( 17)- (18). c) Partial CC slack variables removal (Section III.A).…”

Section: Iterative Solution Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Approximation of Security-Constrained Optimal Power Flow With Incorporation of Generator Frequency and Voltage Control Response

Avramidis

Capitanescu

Karagiannopoulos³

et al. 2021

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

“…One may also implement McCormick envelopes [22] to derive these linear expressions. We replace nonlinear bilinear terms of (5b) for CB equations with (10) and (11) so that it becomes linear constraints.…”

Section: ) Exact Linearization Of Bilinear Functions For Cbmentioning

confidence: 99%

“…To model these detailed representations of the substation configuration for node-breaker models with nonlinear alternating current (AC) power flow, this paper employs the authors' recent work [8]- [10] which has proposed Sparse Tableau Formulation (STF) for power system networks. Inclusion of circuit breaker control action for substation reconfigurations in the AC optimal power flow (ACOPF) increases the computation time significantly, and the overall problem becomes a nonconvex mixed-integer nonlinear programming (MINLP) problem that is NP-hard.…”

Section: Introductionmentioning

confidence: 99%

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

Park

DeMarco

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixedinteger nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.

show abstract

Decomposing convexified security‐constrained AC optimal power flow problem with automatic generation control reformulation

Waseem

Manshadi

2021

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

This paper presents a reformulation for the automatic generation control (AGC) in a decomposed convex relaxation algorithm. It finds an optimal solution to the AC optimal power flow (ACOPF) problem that is secure against a large set of contingencies. The original ACOPF problem which represents the system without contingency constraints, is convexified by applying the second-order cone relaxation method. The contingencies are filtered to distinguish those that will be treated with preventive actions from those that will be left for corrective actions. The selected contingencies for preventive action are included in the set of security constraints. Benders decomposition is employed to decompose the convexified Security-Constrained ACOPF problem into a master problem and several security check subproblems. Subproblems are evaluated in a parallel computing process with enhanced computational efficiency. AGC within each subproblem is modeled by a set of proposed valid constraints, so the procured solution is the physical response of each generation unit during a contingency. Benders optimality cuts are generated for the subproblems having mismatches and the cuts are passed to the master problem to encounter the security-constraints. The accuracy of the relaxation results is verified using the presented tightness measure. The effectiveness of the presented valid AGC constraints and scalability of the proposed algorithm is demonstrated in several case studies.

show abstract

A Sparse Tableau Formulation for Node-Breaker Representations in Security-Constrained Optimal Power Flow

Cited by 22 publications

References 21 publications

A Novel Approximation of Security-Constrained Optimal Power Flow With Incorporation of Generator Frequency and Voltage Control Response

A Novel Approximation of Security-Constrained Optimal Power Flow With Incorporation of Generator Frequency and Voltage Control Response

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

Decomposing convexified security‐constrained AC optimal power flow problem with automatic generation control reformulation

Contact Info

Product

Resources

About