Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Probabilistic security-constrained AC optimal power flow


M. Vrakopoulou, M. Katsampani, K. Margellos, J. Lygeros, G. Andersson

IEEE PowerTech Conference, Grenoble, France

We propose a probabilistic framework for designing an N-1 secure dispatch for systems with fluctuating power sources. This could be used in various applications, however in this work, we demonstrate our approach for a day-ahead planning problem. We extend our earlier work on probabilistic N-1 security, to incorporate recent results on convex AC optimal power flow relaxations. The problem is formulated as a chance constrained convex program; to deal with the chance constraint we follow an algorithm based on a combination of randomized and robust optimization. We also enhance the controllability of the system by introducing a corrective scheme that imposes postcontingency control of the Automatic Voltage Regulation (AVR) set-point. This scheme allows us to inherit a priori probabilistic guarantees regarding the satisfaction of the system constraints, unlike the base case where the AVR set-points are constant. To illustrate the performance of the proposed security-constrained AC optimal power flow we compare it against a DC power flow based formulation using Monte Carlo simulations, and also show that it results to lower operational cost compared to the case where the AVR set-points are constant.


Type of Publication:


No Files for download available.
% Autogenerated BibTeX entry
@Article { VraEtal:2013:IFA_4366,
    author={M. Vrakopoulou and M. Katsampani and K. Margellos and J. Lygeros and G.
    title={{Probabilistic security-constrained AC optimal power flow}},
Permanent link