Optimal Power Flow in Distribution Networks Under N – 1 Disruptions: A Multistage Stochastic Programming Approach

Haoxiang Yang () and Harsha Nagarajan ()
Additional contact information
Haoxiang Yang: Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545; School of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China
Harsha Nagarajan: Theoretical Division (T-5), Los Alamos National Laboratory, Los Alamos, New Mexico 87545

INFORMS Journal on Computing, 2022, vol. 34, issue 2, 690-709

Abstract: Contingency research to find optimal operations and postcontingency recovery plans in distribution networks has gained major attention in recent years. To this end, we consider a multiperiod optimal power flow problem in distribution networks, subject to the N – 1 contingency in which a line or distributed energy resource fails. The contingency can be modeled as a stochastic disruption, an event with random magnitude and timing. Assuming a specific recovery time, we formulate a multistage stochastic convex program and develop a decomposition algorithm based on stochastic dual dynamic programming. Realistic modeling features, such as linearized AC power flow physics, engineering limits, and battery devices with realistic efficiency curves, are incorporated. We present extensive computational tests to show the efficiency of our decomposition algorithm and out-of-samplex performance of our solution compared with its deterministic counterpart. Operational insights on battery utilization, component hardening, and length of recovery phase are obtained by performing analyses from stochastic disruption-aware solutions. Summary of Contribution: Stochastic disruptions are random in time and can significantly alter the operating status of a distribution power network. Most of the previous research focuses on the magnitude aspect with a fixed set of time points in which randomness is observed. Our paper provides a novel multistage stochastic programming model for stochastic disruptions, considering both the uncertainty in timing and magnitude. We propose a computationally efficient cutting-plane method to solve this large-scale model and prove the theoretical convergence of such a decomposition algorithm. We present computational results to substantiate and demonstrate the theoretical convergence and provide operational insights into how making infrastructure investments can hedge against stochastic disruptions via sensitivity analyses.

Keywords: Optimal power flow; N − 1 contingency; distribution network; multistage stochastic program; stochastic disruption (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2021.1080 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:34:y:2022:i:2:p:690-709

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().