Multi-Stage Robust Reactive Power Optimization in Active Distribution Networks With Discrete Intertemporal Constraints

Reactive power regulation is crucial for active distribution networks (ADNs). This paper studies the multi-stage reactive power optimization in ADNs with renewables considering intertemporal constraints imposed on total action times of discrete regulation facilities. First, we regard reactive power regulation as a sequential decision-making process and formulate it as a multi-stage robust optimization problem with hybrid continuous and discrete recourses. Then, we propose a customized implicit policy method to solve this problem, devising bounding variables and non-anticipative constraints of shunt capacitor bank (SCB) and on-load tap changer (OLTC). Next, the bounding variables are optimized prior to dispatch subject to non-anticipative constraints; with their help, intertemporal couplings are broken and the multi-stage robust optimization problem shrinks to a two-stage robust one, which can be solved by decomposition algorithms. Finally, we use the bounding variables to build a non-anticipative and robustly feasible policy based on time-decoupled optimal power flow (OPF) where intertemporal constraints are relaxed but satisfied at the optimums. Case studies on the modified IEEE 33-bus, 69-bus, and 123-bus systems verify the advantages of the proposed method.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Power Systems
Published
2025-02-18
DOI
https://doi.org/10.1109/tpwrs.2025.3543358
Citations
3
Primary Topic
Optimal Power Flow Distribution
Type
article
Field-Weighted Citation Impact
2.19
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Stage Robust Reactive Power Optimization in Active Distribution Networks With Discrete Intertemporal Constraints

Zhongjie Guo, Xiaoyu Cao, Weihao Hu, Wei We
3 citations
IEEE Transactions on Power Systems
Optimal Power Flow Distribution
2.19
article

Multi-Stage Robust Reactive Power Optimization in Active Distribution Networks With Discrete Intertemporal Constraints

Zhongjie Guo, Xiaoyu Cao, Weihao Hu, Wei We
article en
3 citations

Abstract

Reactive power regulation is crucial for active distribution networks (ADNs). This paper studies the multi-stage reactive power optimization in ADNs with renewables considering intertemporal constraints imposed on total action times of discrete regulation facilities. First, we regard reactive power regulation as a sequential decision-making process and formulate it as a multi-stage robust optimization problem with hybrid continuous and discrete recourses. Then, we propose a customized implicit policy method to solve this problem, devising bounding variables and non-anticipative constraints of shunt capacitor bank (SCB) and on-load tap changer (OLTC). Next, the bounding variables are optimized prior to dispatch subject to non-anticipative constraints; with their help, intertemporal couplings are broken and the multi-stage robust optimization problem shrinks to a two-stage robust one, which can be solved by decomposition algorithms. Finally, we use the bounding variables to build a non-anticipative and robustly feasible policy based on time-decoupled optimal power flow (OPF) where intertemporal constraints are relaxed but satisfied at the optimums. Case studies on the modified IEEE 33-bus, 69-bus, and 123-bus systems verify the advantages of the proposed method.

IEEE Transactions on Power SystemsVol. 40(5)
University of Electronic Science and Technology of China (CN), Xi'an Jiaotong University (CN), Tsinghua University (CN)
Affordable and clean energy
Openalex Percentile: Top 14%
Optimal Power Flow Distribution
2.19
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.