Modeling and tackling unit commitment constraint screening under uncertainty

Day-ahead unit commitment (UC) is a fundamental task for power system operators, where generator statuses and power dispatch are determined based on the forecasted nodal net demands. The errors inherent in renewables and load forecasting require uncertainty-aware UC solution procedures, which are nontrivial and time-consuming to solve. In this work, we design a novel screening approach under the forecasting uncertainty to achieve both computation efficiency and solution reliability requirements. Our approach accommodates such uncertainties in both chance-constrained (CC) and robust forms (RO), and can greatly reduce the UC instance size by screening out non-binding constraints. To further improve the screening efficiency, we build upon multi-parametric programming (MPP) theory to convert the underlying screening optimization problem into a piecewise affine function. A multi-area screening approach is further developed to handle the computational intractability issues for large-scale problems. We verify the proposed method’s performance on various UC setups and uncertainty situations. Experimental results show that our robust screening procedure can guarantee better feasibility, while the CC screening can produce more efficient reduced models. On average, the screening time for a single line flow constraint can be accelerated by 71.2X to 131.3X using our proposed method. • We consider the unit commitment constraint screening problem under forecasting uncertainty, which holds great potential for accelerating UC solution and providing reliable decisions. • This work takes an early step in extending the classic deterministic screening framework to accommodate uncertainty-aware UC models. Both principled modeling and solving techniques are proposed for constraint screening under uncertainties. • This work improves the screening efficiency by developing novel affine policies to replace the screening model and proposing a multi-area screening approach for large-scale systems.

Authors

Institutions

Publication Details

Journal
Applied Energy
Published
2026-02-24
DOI
https://doi.org/10.1016/j.apenergy.2026.127582
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modeling and tackling unit commitment constraint screening under uncertainty

Prof. Danny H.K. TSANG, Yize Chen, Xuan He, Yufan Zhang et al.
Applied Energy
Constraint Satisfaction and Optimization
article

Modeling and tackling unit commitment constraint screening under uncertainty

Prof. Danny H.K. TSANG, Yize Chen, Xuan He, Yufan Zhang, Honglin Wen
article en

Abstract

Day-ahead unit commitment (UC) is a fundamental task for power system operators, where generator statuses and power dispatch are determined based on the forecasted nodal net demands. The errors inherent in renewables and load forecasting require uncertainty-aware UC solution procedures, which are nontrivial and time-consuming to solve. In this work, we design a novel screening approach under the forecasting uncertainty to achieve both computation efficiency and solution reliability requirements. Our approach accommodates such uncertainties in both chance-constrained (CC) and robust forms (RO), and can greatly reduce the UC instance size by screening out non-binding constraints. To further improve the screening efficiency, we build upon multi-parametric programming (MPP) theory to convert the underlying screening optimization problem into a piecewise affine function. A multi-area screening approach is further developed to handle the computational intractability issues for large-scale problems. We verify the proposed method’s performance on various UC setups and uncertainty situations. Experimental results show that our robust screening procedure can guarantee better feasibility, while the CC screening can produce more efficient reduced models. On average, the screening time for a single line flow constraint can be accelerated by 71.2X to 131.3X using our proposed method. • We consider the unit commitment constraint screening problem under forecasting uncertainty, which holds great potential for accelerating UC solution and providing reliable decisions. • This work takes an early step in extending the classic deterministic screening framework to accommodate uncertainty-aware UC models. Both principled modeling and solving techniques are proposed for constraint screening under uncertainties. • This work improves the screening efficiency by developing novel affine policies to replace the screening model and proposing a multi-area screening approach for large-scale systems.

Applied EnergyVol. 410
University of Alberta (CA), University of San Diego (US), Shanghai Jiao Tong University (CN), University of California San Diego (US), Guangzhou University (CN), University of Hong Kong (HK)
Openalex Percentile: Top 53%
Constraint Satisfaction and 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.