A Direct Approach for the Security Constrained

Zaoui, Fabrice; Fliscounakis, S.

doi:10.1109/psce.2006.296146

Cited by 6 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the theory developed in this paper using the DC power flow model has a straightforward extension to the non-linear AC power flow model. One could use existing numerical techniques to handle the non-convexity of ACOPF [18] and implement our reduced formulations in the ACOPF context.…”

Section: Discussionmentioning

confidence: 99%

“…Due to the design of the power system the probability that a contingency occurs is very low and is thus hard to estimate. Therefore, it is common practice in the literature to not consider the cost of generation under contingencies [14], [18]. For the normal state, the power balance, generation capacity, normal transmission line capacity, and ramping constraints are (1b), (1c), (1d), and (1e), respectively.…”

Section: Comprehensive Lascopfmentioning

confidence: 99%

“…In the literature, security constraints were first considered for single dispatch interval OPF, called security constrained OPF (SCOPF) [16]. The SCOPF was initially formulated considering outages in transmission lines [17], but more recent works on SCOPF consider outages in generators or in both [18]. The model in [19] considers generation reserves (which allow recovery from generator contingencies), but does not explicitly consider any security constraints.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A Scalable Formulation for Look-Ahead Security-Constrained Optimal Power Flow

Varawala

Hesamzadeh

Dán

et al. 2022

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

We consider the look-ahead security-constrained optimal power flow (LASCOPF) problem under transmission line and generator contingencies. We first formulate LASCOPF under the N −1 contingency criterion (LASCOPF1) using the DC power flow model. We observe that the number of decision variables in the comprehensive formulation increases quadratically with the number of look-ahead intervals, T , making the problem infeasible to solve for large T . To overcome this, we propose the reduced LASCOPF problem (LASCOPF-r1) in which the number of decision variables increases only linearly with T . Thereafter, we prove that, barring borderline cases, if LASCOPF1 is feasible then the optimal solutions of LASCOPF1 and LASCOPF-r1 are equivalent. We then extend our results to the N − k contingency criterion (LASCOPF-ru k ) for any collection of k contingencies, and we prove that the ordering of the contingencies does not affect the optimal solution. We then illustrate LASCOPF1 on a simple 2-bus 2-generator system. We show the numerical benefits of the proposed LASCOPF-r1 formulation on the IEEE 118-bus, the IEEE 300-bus and the 2383-bus Polish systems.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Comprehensive Lascopfmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

A Scalable Formulation for Look-Ahead Security-Constrained Optimal Power Flow

Varawala

Hesamzadeh

Dán

et al. 2022

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

show abstract

“…[14]. However, such approaches suffer from the limitation of depending on centralised decision making and extensive communication of analysis results to very many different locations.…”

Section: Existing Approaches: Hand-coded Targets and Reactive Systemsmentioning

confidence: 99%

The role of AI planning as a decision support tool in power substation management

et al. 2009

View full text Add to dashboard Cite

The management of power substations is a challenging task, with two opposing criteria: to reduce wear-and-tear on equipment and to ensure the voltage remains within a specified range. At present, a two-stage process is used. Voltage targets are determined for each time of day by electrical engineers using a time-consuming and costly manual process. Then, a reactive control system at the substation is used to satisfy these targets. In this article, we present a novel application of AI planning as part of an intelligent automated system for devising voltage targets. Within the system, both the cost and fault-tolerance implications of voltage target decisions are considered, and hence an efficient and effective set of voltage targets is produced. Using AI planning affords a great deal of flexibility and we show how the system can handle known exogenous events for a given day to reduce forecasted operational costs.

show abstract

“…The ordering was done using MATLAB functions. Reference [14] uses MUMPS, a parallel multifrontal solver [15][16][17][18][19][20][21], on a Linux platform for symmetric indefinite matrices that arises in the solution of security constrained AC-OPF problem. We are not aware of any other multifrontal implementations for the power system AC load flow solutions with unsymmetric Jacobian matrices.…”

Section: Introductionmentioning

confidence: 99%

Numerical methods for on-line power system load flow analysis

2010

View full text Add to dashboard Cite

Newton-Raphson method is the most widely accepted load flow solution algorithm. However LU factorization remains a computationally challenging task to meet the real-time needs of the power system. This paper proposes the application of very fast multifrontal direct linear solvers for solving the linear system sub-problem of power system real-time load flow analysis by utilizing the state-of-the-art algorithms for ordering and preprocessing. Additionally the unsymmetric multifrontal method for LU factorization and highly optimized Intel ® Math Kernel Library BLAS has been used. Two state-of-the-art multifrontal algorithms for unsymmetric matrices namely UMFPACK V5.2.0 and sequential MUMPS 4.8.3 ("Multifrontal Massively Parallel Solver") are customized for the AC power system Newton-Raphson based load flow analysis. The multifrontal solvers are compared against the state-of-the-art sparse Gaussian Elimination based HSL sparse solver MA48. This study evaluates the performance of above multifrontal solvers in terms of number of factors, computational time, number of floating-point operations and memory, in the context of load flow solution on nine systems including very large real power systems. The results of the performance evaluation are reported. The proposed method achieves significant reduction in computational time.

show abstract

A Direct Approach for the Security Constrained

Cited by 6 publications

References 15 publications

A Scalable Formulation for Look-Ahead Security-Constrained Optimal Power Flow

A Scalable Formulation for Look-Ahead Security-Constrained Optimal Power Flow

The role of AI planning as a decision support tool in power substation management

Numerical methods for on-line power system load flow analysis

Contact Info

Product

Resources

About