journal article·2025-04-18Open access

Stable Variable Fixation for Accelerated Unit Commitment via Graph Neural Network and Linear Programming Hybrid Learning

Linfeng Yang, Peilun Li, Shifei Chen, Haiyan Zheng

Applied Sciences· Volume 15· Issue 8

Abstract

The Unit Commitment Problem (UCP) is a critical component of power market decision-making and is typically formulated as Mixed Integer Programming (MIP). Given the complexity of solving MIPs, efficiently solving large-scale UCPs remains a significant challenge. This paper presents a hybrid Graph Neural Network (GNN)–Linear Programming (LP) framework to accelerate the solution of large-scale Unit Commitment Problems (UCPs) while maintaining the quality of solutions. By analyzing variable stability through historical branch-and-bound (B&B) trajectories, we classify MIP variables into dynamically adjustable stable and unstable groups. We adopt an MIP formulation that includes multiple types of binary variables—such as commitment, startup, and shutdown variables—and extract additional information from these auxiliary binary variables. This enriched representation provides more candidates for stable variable fixation, helping to improve variable refinement, mitigate suboptimality, and enhance computational efficiency. A bipartite GNN is trained offline to predict stable variables based on system topology and historical operational patterns. During online optimization, instance-specific root LP solutions refine these predictions, enabling adaptive variable fixation via a dual-threshold mechanism that integrates GNN confidence and LP relaxations. To mitigate suboptimality risks, we introduce temporally flexible fixation strategies—hard fixation for variables with persistent stability and soft fixation allowing limited temporal adjustments—alongside a GNN-guided branching rule to prioritize unstable variables. Numerical experiments demonstrate that jointly fixing commitment, startup, and shutdown variables yields better performance compared to fixing only commitment variables. Ablation studies further validate the importance of hard fixation and customized branching strategies, especially for large-scale systems.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Optimization and Search Problems · Machine Learning and ELM

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Guangxi Key Laboratory of Multimedia Communication and Network Technology, School of Computer Electronics and Information, Guangxi University, Nanning 530004, China

School of Electrical Engineering, Guangxi University, Nanning 530004, China

School of Mathematics and Information Science, Guangxi University, Nanning 530004, China

Funding

National Natural Science Foundation of China · Key Research and Development Program of Guangxi

References (29)

Show source-provided references
1. Unit commitment in electric energy systems10.1561/3100000014 ↗
2. Representing Operational Flexibility in Generation Expansion Planning Through Convex Relaxation of Unit Commitment10.1109/TPWRS.2017.2735026 ↗
3. Unit commitment by enhanced adaptive Lagrangian relaxation10.1109/TPWRS.2003.820707 ↗
4. Enhanced priority list unit commitment method for power systems with a high share of renewables10.1016/j.epsr.2013.07.014 ↗
5. An enhanced dynamic programming approach for unit commitment10.1109/59.14582 ↗
6. Gurobi Optimizer Reference Manual
7. Ibm, L. (2024, December 01). ILOG CPLEX. Available online: http://www.ilog.com/products/cplex.
8. On the complexity of the unit commitment problem10.1007/s10479-018-2827-x ↗
9. A novel projected two-binary-variable formulation for unit commitment in power systems10.1016/j.apenergy.2016.11.096 ↗
10. Harjunkoski, I., Giuntoli, M., Poland, J., and Schmitt, S. (2021, January 18–21). Matheuristics for Speeding Up the Solution of the Unit Commitment Problem. Proceedings of the 2021 IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe), Espoo, Finland.10.1109/ISGTEurope52324.2021.9640029 ↗
11. Unit Commitment Predictor with a Performance Guarantee: A Support Vector Machine Classifier10.1109/TPWRS.2024.3400405 ↗
12. Optimality Guaranteed UC Acceleration via Interactive Utilization of Adjoint Model10.1109/TPWRS.2023.3329986 ↗
13. Deep Reinforcement Learning-Assisted Convex Programming for AC Unit Commitment and Its Variants10.1109/TPWRS.2023.3340674 ↗
14. Chen, Z., Liu, J., Wang, X., and Yin, W. (2023, January 1–5). On Representing Mixed-Integer Linear Programs by Graph Neural Networks. Proceedings of the Eleventh International Conference on Learning Representations, Kigali, Rwanda.
15. Schmitt, S., Harjunkoski, I., Giuntoli, M., Poland, J., and Feng, X. (2022, January 9–12). Fast Solution of Unit Commitment Using Machine Learning Approaches. Proceedings of the 2022 IEEE 7th International Energy Conference (ENERGYCON), Riga, Latvia.10.1109/ENERGYCON53164.2022.9830191 ↗
16. Tighter relaxation method for unit commitment based on second-order cone programming and valid inequalities10.1016/j.ijepes.2013.08.027 ↗
17. A Unit Commitment Algorithm with Relaxation-Based Neighborhood Search and Improved Relaxation Inducement10.1109/TPWRS.2020.2981374 ↗
18. Huang, T., Ferber, A., Tian, Y., Dilkina, B., and Steiner, B. (June, January 29). Local branching relaxation heuristics for integer linear programs. Proceedings of the International Conference on Integration of Constraint Programming Artificial Intelligence, and Operations Research, Nice, France.
19. Optimality-Guaranteed Acceleration of Unit Commitment Calculation via Few-shot Solution Prediction10.1109/TPWRS.2024.3438769 ↗
20. Is learning for the unit commitment problem a low-hanging fruit?10.1016/j.epsr.2022.107851 ↗
21. Learning to solve large-scale security-constrained unit commitment problems
22. Intelligent data-driven decision-making method for dynamic multisequence: An E-seq2seq-based SCUC expert system10.1109/TII.2021.3107406 ↗
23. Feasibility Layer Aided Machine Learning Approach for Day-Ahead Operations10.1109/TPWRS.2023.3266192 ↗
24. Confidence-Aware Graph Neural Networks for Learning Reliability Assessment Commitments10.1109/TPWRS.2023.3298735 ↗
25. Han, Q., Yang, L., Chen, Q., Zhou, X., Zhang, D., Wang, A., Sun, R., and Luo, X. (2023, January 1–5). A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming. Proceedings of the Eleventh International Conference on Learning Representations, Kigali, Rwanda.
26. Qin, J., and Yu, N. (2023). Solve Large-scale Unit Commitment Problems by Physics-Informed Graph Learning. arXiv.
27. Gasse, M., Chételat, D., Ferroni, N., Charlin, L., and Lodi, A. (2019). Exact Combinatorial Optimization with Graph Convolutional Neural Networks. arXiv.
28. Gridmod (2024, December 01). RTS-GMLC: Repository for Grid Modernization Lab Consortium (GMLC) Real-Time Simulation Project. In GitHub. Available online: https://github.com/GridMod/RTS-GMLC.
29. Berthold, T. (2006). Primal Heuristics for Mixed Integer Programs. [Master’s Thesis, Technische Universität].