Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty

被引:327
作者
Bienstock, Daniel [1 ,2 ]
Chertkov, Michael [3 ,4 ]
Harnett, Sean [2 ,4 ]
机构
[1] Columbia Univ, Dept Ind Engn & Operat Res, New York, NY 10027 USA
[2] Columbia Univ, Dept Appl Phys & Appl Math, New York, NY 10027 USA
[3] Los Alamos Natl Lab, Div Theoret, Los Alamos, NM 87545 USA
[4] Los Alamos Natl Lab, Ctr Nonlinear Studies, Los Alamos, NM 87545 USA
关键词
optimization; power flows; uncertainty; wind farms; networks; UNIT COMMITMENT; ALGORITHM;
D O I
10.1137/130910312
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
When uncontrollable resources fluctuate, optimal power flow (OPF), routinely used by the electric power industry to redispatch hourly controllable generation (coal, gas, and hydro plants) over control areas of transmission networks, can result in grid instability and, potentially, cascading outages. This risk arises because OPF dispatch is computed without awareness of major uncertainty, in particular fluctuations in renewable output. As a result, grid operation under OPF with renewable variability can lead to frequent conditions where power line flow ratings are significantly exceeded. Such a condition, which is borne by our simulations of real grids, is considered undesirable in power engineering practice. Possibly, it can lead to a risky outcome that compromises grid stability-line tripping. Smart grid goals include a commitment to large penetration of highly fluctuating renewables, thus calling to reconsider current practices, in particular the use of standard OPF. Our chance-constrained (CC) OPF corrects the problem and mitigates dangerous renewable fluctuations with minimal changes in the current operational procedure. Assuming availability of a reliable wind forecast parameterizing the distribution function of the uncertain generation, our CC-OPF satisfies all the constraints with high probability while simultaneously minimizing the cost of economic redispatch. CC-OPF allows efficient implementation, e. g., solving a typical instance over the 2746-bus Polish network in 20 seconds on a standard laptop.
引用
收藏
页码:461 / 495
页数:35
相关论文
共 53 条
  • [1] Second-order cone programming
    Alizadeh, F
    Goldfarb, D
    [J]. MATHEMATICAL PROGRAMMING, 2003, 95 (01) : 3 - 51
  • [2] [Anonymous], 2009, INT C LARG HIGH VOLT
  • [3] [Anonymous], DOEGO1020082567
  • [4] [Anonymous], ARXIV11044558
  • [5] [Anonymous], P 2011 IEEE POW EN S
  • [6] [Anonymous], 2012, WIND GENERATION TOTA
  • [7] [Anonymous], 1948, Handbook of Mathematical Functions withFormulas, Graphs, and Mathematical Tables, DOI DOI 10.1119/1.15378
  • [8] [Anonymous], 2007, INT REN RES TREANSM
  • [9] Automatic Generation Control and its Implementation in Real Time
    Apostolopoulou, Dimitra
    Sauer, Peter W.
    Dominguez-Garcia, Alejandro D.
    [J]. 2014 47TH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES (HICSS), 2014, : 2444 - 2452
  • [10] Baghsorkhi S.S., 2012, 2012 IEEE INT SYSTEM, P1