Data-Driven Screening of Network Constraints for Unit Commitment
Not on the map. Why?
Abstract (arXiv)
The transmission-constrained unit commitment (TC-UC) problem is one of the most relevant problems solved by independent system operators for the daily operation of power systems. Given its computational complexity, this problem is usually not solved to global optimality for real-size power systems. In this paper, we propose a data-driven method that leverages historical information to screen out network constraints in the TC-UC problem. First, past data on demand and renewable generation throughout the network are used to learn the congestion status of transmission lines. Then, we infer the lines that will not become congested for upcoming operating conditions based on such learning and disregard their capacity constraints. This way, we formulate a reduced TC-UC problem that is easier to solve. Numerical results on a medium- and a large-size power system show that the proposed approach outperforms existing ones by significantly reducing the computational time while obtaining solutions that are equal or close to the one obtained with the original TC-UC problem. Furthermore, the purely data-driven method we propose can be seamlessly complemented with a constraint generation procedure to guarantee that the optimal solution to the original TC-UC problem is eventually recovered.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 3; 2024: 1; 2025: 1; 2026: 1.
11 papers.
- 2021Ensuring DNN Solution Feasibility for Optimization Problems with Convex Constraints and Its Application to DC Optimal Power Flow Problemscited by 6
- 2022Massively Digitized Power Grid: Opportunities and Challenges of Use-inspired AIcited by 6
- 2022Feasibility Layer Aided Machine Learning Approach for Day-Ahead Operationscited by 6
- 2023Spatio-Temporal Deep Learning-Assisted Reduced Security-Constrained Unit Commitmentcited by 6
- 2021Machine Learning Assisted Approach for Security-Constrained Unit Commitmentcited by 5
- 2022Enabling Fast Unit Commitment Constraint Screening via Learning Cost Modelcited by 1
- 2023Unit Commitment Predictor With a Performance Guarantee: A Support Vector Machine Classifiercited by 0
- 2023Operational risk quantification of power grids using graph neural network surrogates of the DC OPFcited by 0
- 2024Towards An Unsupervised Learning Scheme for Efficiently Solving Parameterized Mixed-Integer Programscited by 0
- 2025A Data-Driven Real-Time Optimal Power Flow Algorithm Using Local Feedbackcited by 0
- 2026WARP: A Benchmark for Primal-Dual Warm-Starting of Interior-Point Solverscited by 0
- 2026WARP: A Benchmark for Primal-Dual Warm-Starting of Interior-Point Solvers7 May 2026
- 2025A Data-Driven Real-Time Optimal Power Flow Algorithm Using Local Feedback21 Feb 2025
- 2024Towards An Unsupervised Learning Scheme for Efficiently Solving Parameterized Mixed-Integer Programs23 Dec 2024
- 2023Operational risk quantification of power grids using graph neural network surrogates of the DC OPF7 Nov 2023
- 2023Unit Commitment Predictor With a Performance Guarantee: A Support Vector Machine Classifier7 Oct 2023
- 2023Spatio-Temporal Deep Learning-Assisted Reduced Security-Constrained Unit Commitment2 Jun 2023
- 2022Enabling Fast Unit Commitment Constraint Screening via Learning Cost Model1 Dec 2022
- 2022Feasibility Layer Aided Machine Learning Approach for Day-Ahead Operations13 Aug 2022
- 2022Massively Digitized Power Grid: Opportunities and Challenges of Use-inspired AI10 May 2022
- 2021Ensuring DNN Solution Feasibility for Optimization Problems with Convex Constraints and Its Application to DC Optimal Power Flow Problems15 Dec 2021
- 2021Machine Learning Assisted Approach for Security-Constrained Unit Commitment17 Nov 2021