A Real Time Optimizer for Security Dispatch

The paper presents results from the development and testing of an algorithm for security constrained dispatch calculations wherein closed area MW, line MW and MVA, and line-group MW constraints must be considered to insure system security. An overview of the algorithm and partial results from full-scale benchmark tests using a real-time 1200 bus / 1500 line model and an optimal power flow (OPF) are presented in the body of the paper. Several appendices are included to outline the techniques used in the algorithm development.

Section: Solution Methodsmentioning

confidence: 99%

“…The SGR and the network constraints are both modeled as linear constraints about the current operating point as in [1].…”

Section: Constraint Modelingmentioning

confidence: 99%

An Algorithm for Real-Time Security Constrained Economic Dispatch

Sanders¹,

Monroe²

1987

“…The literature recalls this well-known model as the classical DC power flow [1], [2], which results in large errors (due to the lossless assumption) for non-small power systems and systems with , as reported in [11]- [14].…”

Section: B Cold-start Modelmentioning

confidence: 99%

“…These quantities are necessary for electricity market applications, such as real-time security constrained economic dispatch (SCED) [1], [2], security constrained unit commitment (SCUC) [3]- [5], financial transmission rights (FTR), congestion revenue rights (CRR) auctions and allocations [6], [7], locational marginal pricing (LMPs) where prices are constrained by network congestion, as well as contingency analysis such as evaluating line loading constraints. Inaccuracies in either of these quantities can lead to significant economic costs or system failures.…”

Section: Introductionmentioning

confidence: 99%

Introducing a Novel DC Power Flow Method With Reactive Power Considerations

Fatemi

Abedi

Gharehpetian

et al. 2015

The DC power flow model is in widespread utilization in electricity-market applications and contingency analysis. The presented versions of this model can be classified into two categories: state-dependent, or Hot-Start, models and state-independent, or Cold-Start, models. A reasonable accuracy is reported in the literature regarding Hot-Start models as they take into account branch losses and bus voltages by using available base point. On the contrary, due to the absence of base point in Cold-Start models, branch losses must be either neglected or guessed (which is an uncertain precautionary measure), or evaluated by a cumbersome iteration process. In addition, the bus voltage profiles are inevitably considered to be flat. Hence, the accuracy of available Cold-Start models in different circumstances remains of great concern. This paper addresses this concern and unveils a new Cold-Start model that does not rely on a risky assumption. In other words, there will be no lossless or flat voltage profile assumption in the presented approach whereas the equations remain linear. Besides, the exact effect of the net reactive loads on phase angles is considered and, consequently, the reactive power balance equations are reflected in the model for the first time.Index Terms-Cold-start models, DC power flow, hot-start models, loss modeling, modified phase angle.

“…These iterative algorithms appeared in the 1970' s , wollenberg & Stadlin 1974, Shoults 1977. Bas ically, they use the EICC method as a subprobleLl, updating nonlinear information and handling dependent constraints at each iteration.…”

mentioning

confidence: 99%

An investigation of the solution to the optimal power flow problem incorporating continuation methods

Huneault

Galiana

1990

This thesis analyzès and tests some néw solution techniques for the optimal power flow problem.This new methodology exploits a parametric technique, callp-d the continuation method, which is applied to different tasks in the solution procedure. In a first application, th'e continuation method l solves the-quadratic subp:t;oblems generàted sequentially by the optimal power This thesis first presents an analysis of the various structures used in optimal power flow algorithms. Then, having chosen and presented the structure of our algorithm, we analyze the quadratic subproblems generated by this algorithm for sorne of its more important tasks: minimum cost, minimum losses and load shedding. New rules are proposed to link the solutions of successive subproblems to erwure the convergence of the nonlinear problem.Then, as a final contribution to the theory, some extensions are suggested for the subproblems: among them are ramp constraints, bus incremental costs, and ~ provisioml for redf'spatching.Numerical simulations of the proposed optimal power flow algorithm using the minimum fuel cast task were performed 'on four test systems. with sizes•