Cost-effective Closed-loop Bilevel Robust Optimization for Joint Chance-constrained Economic Dispatch

The day-ahead economic dispatch (ED) problems are critical in modern power systems operations.Traditionally, ED problems are solved using stochastic optimization (SO) methods, such as chanceconstrained optimization (CCO), robust optimization (RO), and distributionally robust optimization (DRO).These methods usually follow a two-stage open-loop process: firstly, random variables (including distributions, uncertainty sets, and ambiguity sets) are estimated using historical data; then, the ED problem is solved based on these estimations.However, this approach often leads to suboptimal performance because the objectives in the two stages are misaligned: minimizing estimation errors does not necessarily result in the lowest possible ED costs.To tackle this challenge, we propose a closed-loop optimization framework that unifies and jointly optimizes the two stages through bilevel robust optimization.This method ensures the optimal ED cost while simultaneously satisfying joint chance constraints.To enhance computational efficiency, we transform the bilevel robust optimization problem into a more tractable bilevel linear programming problem.Furthermore, we introduce two parametric fine-tuning strategies to improve the performance of our closed-loop solution.Numerical studies using field data validate the effectiveness of the proposed frameworks. CCS Concepts

Authors

Institutions

Publication Details

Published
2025-06-16
DOI
https://doi.org/10.1145/3679240.3734624
Primary Topic
Electric Power System Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cost-effective Closed-loop Bilevel Robust Optimization for Joint Chance-constrained Economic Dispatch

Chenye Wu, Chenbei Lu, Hongyu Yi, Jinhao Liang
Electric Power System Optimization
article

Cost-effective Closed-loop Bilevel Robust Optimization for Joint Chance-constrained Economic Dispatch

Chenye Wu, Chenbei Lu, Hongyu Yi, Jinhao Liang
article en

Abstract

The day-ahead economic dispatch (ED) problems are critical in modern power systems operations.Traditionally, ED problems are solved using stochastic optimization (SO) methods, such as chanceconstrained optimization (CCO), robust optimization (RO), and distributionally robust optimization (DRO).These methods usually follow a two-stage open-loop process: firstly, random variables (including distributions, uncertainty sets, and ambiguity sets) are estimated using historical data; then, the ED problem is solved based on these estimations.However, this approach often leads to suboptimal performance because the objectives in the two stages are misaligned: minimizing estimation errors does not necessarily result in the lowest possible ED costs.To tackle this challenge, we propose a closed-loop optimization framework that unifies and jointly optimizes the two stages through bilevel robust optimization.This method ensures the optimal ED cost while simultaneously satisfying joint chance constraints.To enhance computational efficiency, we transform the bilevel robust optimization problem into a more tractable bilevel linear programming problem.Furthermore, we introduce two parametric fine-tuning strategies to improve the performance of our closed-loop solution.Numerical studies using field data validate the effectiveness of the proposed frameworks. CCS Concepts

Chinese University of Hong Kong, Shenzhen (CN), University of Virginia (US), Tsinghua University (CN)
National Natural Science Foundation of China, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 88%
Electric Power System Optimization
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.