skip to main content

DOE PAGESDOE PAGES

Title: Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms

Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.
Authors:
ORCiD logo [1] ;  [2]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. ETH Zurich (Switzerland)
Publication Date:
Report Number(s):
LA-UR-17-23772
Journal ID: ISSN 0885-8950; TRN: US1800781
Grant/Contract Number:
AC52-06NA25396
Type:
Accepted Manuscript
Journal Name:
IEEE Transactions on Power Systems
Additional Journal Information:
Journal Volume: 33; Journal Issue: 3; Journal ID: ISSN 0885-8950
Publisher:
IEEE
Research Org:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org:
USDOE Laboratory Directed Research and Development (LDRD) Program
Country of Publication:
United States
Language:
English
Subject:
24 POWER TRANSMISSION AND DISTRIBUTION; 97 MATHEMATICS AND COMPUTING; Mathematics
OSTI Identifier:
1415379

Roald, Line Alnaes, and Andersson, Goran. Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms. United States: N. p., Web. doi:10.1109/TPWRS.2017.2745410.
Roald, Line Alnaes, & Andersson, Goran. Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms. United States. doi:10.1109/TPWRS.2017.2745410.
Roald, Line Alnaes, and Andersson, Goran. 2017. "Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms". United States. doi:10.1109/TPWRS.2017.2745410. https://www.osti.gov/servlets/purl/1415379.
@article{osti_1415379,
title = {Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms},
author = {Roald, Line Alnaes and Andersson, Goran},
abstractNote = {Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.},
doi = {10.1109/TPWRS.2017.2745410},
journal = {IEEE Transactions on Power Systems},
number = 3,
volume = 33,
place = {United States},
year = {2017},
month = {8}
}