Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient Solution Strategy for Chance-Constrained Optimal Power Flow based on FAST and Data-driven Convexification (2105.05336v2)

Published 11 May 2021 in math.OC, cs.SY, and eess.SY

Abstract: The uncertainty of multiple power loads and renewable energy generations (PLREG) in power systems increases the complexity of power flow analysis for decision-makers. The chance-constrained method can be applied to model the optimization problems of power flow under uncertainty. This paper develops a novel solution approach for chance-constrained AC optimal power flow (CCACOPF) problem based on the data-driven convexification of power flow and a fast algorithm for scenario technique (FAST). This method is computationally effective for mainly two reasons. First, the original nonconvex AC power flow (ACPF) constraints are approximated by a set of learning-based quadratic convex ones. Second, FAST is an advanced scenario-based solution method (SSM) that doesn't rely on the pre-assumed probability distribution, using far less scenarios than the conventional SSM. Eventually, the CCACOPF is converted into a computationally tractable convex optimization problem. The simulation results on IEEE test cases indicate that 1) the proposed solution method can outperform the conventional SSM in computational efficiency, 2) the data-driven convexification of power flow is effective in approximating original complex AC power flow.

Citations (2)

Summary

We haven't generated a summary for this paper yet.