Fast Infeasibility Analysis of Network-constrained Unit Commitment Model

Yanhong Liu; Xinfei Yan; Haiwang Zhong; Chongqing Kang

doi:10.35833/MPCE.2025.000736

欢迎来到能源电力期刊网！

English Version 期刊登录

您当前的位置：

首页 >

文章列表页 >

Fast Infeasibility Analysis of Network-constrained Unit Commitment Model

Original Paper | 更新时间：2026-09-28

- Fast Infeasibility Analysis of Network-constrained Unit Commitment Model
- Fast Infeasibility Analysis of Network-constrained Unit Commitment Model
- MPCE 2026年14卷第5期页码：1696-1707
- 作者机构：
  
  1.State Key Laboratory of Power System Operation and Control, Department of Electrical Engineering, Tsinghua University, Beijing, China
  2.Sichuan Energy Internet Research Institute, Tsinghua University, Chengdu, China
- 作者简介：
  
  Yanhong Liu received the B.S. degree in electrical engineering from Tsinghua University, Beijing, China, in 2024, where he is currently working toward the Ph.D. degree in electrical engineering. His research interests focus on power system operation. Email:lyhthu@126.com;
  Xinfei Yan received the B.S. and Ph.D. degrees in electrical engineering from Tsinghua University, Beijing, China, in 2019 and 2025, respectively. He is currently a Post-doctor in Tsinghua University. His research interests include distributed optimization algorithm and power system operation. Email:yanxinfei1994@126.com
  Haiwang Zhong received the B.S. and Ph.D. degrees in electrical engineering from Tsinghua University, Beijing, China, in 2008 and 2013, respectively. He is currently an Associate Professor with the Department of Electrical Engineering, Tsinghua University. He is also the Director of Energy Internet Trading and Operation Research Department of Sichuan Energy Internet Research Institute, Tsinghua University, Chengdu, China. He was a recipient of the ProSPER.Net Young Scientist Award and the Outstanding Postdoctoral Fellow of Tsinghua University. He currently serves as the Convenor of CIGRE C1.54 Working Group on assessment of system reserves and flexibility needs in the power systems of the future. His research interests include power system operation and optimization and electricity market. Email:zhonghw@tsinghua.edu.cn
  Chongqing Kang received the Ph.D. degree from the Department of Electrical Engineering, Tsinghua University, Beijing, China, in 1997. He is currently a Professor with Tsinghua University. His research interests include load forecasting, electricity market, power system planning, and generation scheduling optimization. Email:cqkang@tsinghua.edu.cn
- 基金信息：
  
  National Science and Technology Major Project on Smart Grid (2030)(2025ZD0805400);National Natural Science Foundation of China(U24B2077)
- DOI：10.35833/MPCE.2025.000736
  中图分类号：
- 收稿：2025-08-13，
  
  修回：2025-11-18，
  
  录用：2026-01-05，
  
  网络首发：2026-02-27，
  
  纸质出版：2026-09-15
- 稿件说明：
移动端阅览
Yanhong Liu, Xinfei Yan, Haiwang Zhong, 等. Fast Infeasibility Analysis of Network-constrained Unit Commitment Model[J]. MPCE, 2026,14(5):1696-1707.

Liu Yanhong,Yan Xinfei,Zhong Haiwang,et al.Fast Infeasibility Analysis of Network-constrained Unit Commitment Model[J].Journal of Modern Power Systems and Clean Energy,2026,14(05):1696-1707.
Yanhong Liu, Xinfei Yan, Haiwang Zhong, 等. Fast Infeasibility Analysis of Network-constrained Unit Commitment Model[J]. MPCE, 2026,14(5):1696-1707. DOI： 10.35833/MPCE.2025.000736.

Liu Yanhong,Yan Xinfei,Zhong Haiwang,et al.Fast Infeasibility Analysis of Network-constrained Unit Commitment Model[J].Journal of Modern Power Systems and Clean Energy,2026,14(05):1696-1707. DOI： 10.35833/MPCE.2025.000736.

摘要

Abstract

With the rapid development of the electricity market and the increasingly stringent operational standards

the longstanding infeasible network-constrained unit commitment (NCUC) issue in market operations is calling for effective and systematic methods that can analyze and repair infeasible NCUC models. Studies show that a set of irreducible infeasible subsets (IISs) may lead to infeasibility in a model. The identification and repair of IISs can correct the original infeasible model

while traditional filtering algorithms for IIS location often exhibit computational inefficiency. A fast infeasibility analysis framework of NCUC and a relaxation filtering algorithm are proposed in this paper to analyze infeasible NCUC models more comprehensively and effectively. The infeasibility analysis framework employs subsystem-based IIS analysis method

generating and analyzing simplified models to repair the infeasible NCUC. The relaxation filtering algorithm can achieve greater effectiveness of IIS identification in the holistic NCUC compared with traditional general filtering algorithms. The case studies show that the proposed framework and algorithm can analyze and repair infeasible NCUC models effectively

reducing the analytical time by at least one order of magnitude compared with that of traditional general methods.

关键词

Keywords

references

Y. Chen, F. Pan, F. Qiu et al. , “Security-constrained unit commitment for electricity market: modeling, solution methods, and future challenges,” IEEE Transactions on Power Systems , vol. 37 , no. 2 , pp. 1119 - 1132 , Mar. 2022 .

Z. Ma, H. Zhong, T. Cheng et al. , “Redundant and nonbinding transmission constraints identification method combining physical and economic insights of unit commitment,” IEEE Transactions on Power Systems , vol. 36 , no. 5 , pp. 3487 - 3495 , Sept. 2021.

PJM Interconnection. (2022, Mar.). PJM manual 11: energy & ancillary services market operations. [Online]. Available: https://www.pjm.com

South China Energy Regulatory Bureau of National Energy Administration of the People’s Republic of China. (2022, Jan.). Detailed rules for the implementation of spot electricity energy trading in the Guangdong electricity market (trial version 2022). [Online]. Available: https://nfj.nea.gov.cn/nfjdoc/aa9c1ba4-c055-4a6a-8b33-72e5203d42bf.pdf

Shanxi Power Exchange Center. (2022, Jun.). Compilation of rules for the Shanxi electricity market (pilot operation V12.0). [Online]. Available: https://pmos.sx.sgcc.com.cn/pxf-settlement-outnetpub/#/pxf-settlement-outnetpub/unstructedInfo?flag=1&fileId=nfad9d33d5b2244c0b9455fdf95bdcda9

R. Sioshansi, R. O’Neill, and S. S. Oren, “Economic consequences of alternative solution methods for centralized unit commitment in day-ahead electricity markets,” IEEE Transactions on Power Systems , vol. 23 , no. 2 , pp. 344 - 352 , May 2008.

C. He, Q. Chen, H. Zhong et al. , “A homogenized-overload model applied for infeasible security-constrained unit commitment (SCUC) problem,” in Proceedings of 2015 IEEE 28th Canadian Conference on Electrical and Computer Engineering , Halifax, Canada, May 2015, pp. 242 - 247 .

L. D. Secchin, G. M. Ramalho, C. Sagastizábal et al. (2022, Jan.). Analysis of infeasible unit-commitment solutions arising in energy optimization. [Online ] . Available: https://arxiv.org/abs/2201.07163

Y. Sahraoui, P. Bendotti, and C. D’Ambrosio, “Real-world hydro-power unit-commitment: dealing with numerical errors and feasibility issues,” Energy , vol. 184 , pp. 91 - 104 , Oct. 2019 .

Z. Yang, G. Tang, and L. Li, “Application of relaxed constraints model on generation schedule optimization,” Automation of Electric Power Systems , vol. 34 , no. 14 , pp. 53 - 57 , Jul. 2010 .

N. Chakravarti, “Some results concerning post-infeasibility analysis,” European Journal of Operational Research , vol. 73 , no. 1 , pp. 139 - 143 , Feb. 1994 .

Y. Sahraoui, “Short-term hydropower production scheduling: feasibility and modeling,” Ph.D. dissertation, Université Paris Saclay, Paris, France, 2016.

J. W. Chinneck, “Finding a useful subset of constraints for analysis in an infeasible linear program,” INFORMS Journal on Computing , vol. 9 , no. 2 , pp. 164 - 174 , May 1997.

E. Amaldi, M. E. Pfetsch, and L. E. Trotter, “On the maximum feasible subsystem problem, IISs and IIS-hypergraphs,” Mathematical Programming , vol. 95 , no. 3 , pp. 533 - 554 , Mar. 2003 .

M. Parker and J. Ryan, “Finding the minimum weight IIS cover of an infeasible system of linear inequalities,” Annals of Mathematics and Artificial Intelligence , vol. 17 , no. 1-2, pp. 107 - 126 , Mar. 1996 .

J. W. Chinneck and E. W. Dravnieks, “Locating minimal infeasible constraint sets in linear programs,” ORSA Journal on Computing , vol. 3 , no. 2 , pp. 157 - 168 , May 1991.

O. Guieu and J. W. Chinneck, “Analyzing infeasible mixed-integer and integer linear programs,” INFORMS Journal on Computing , vol. 11 , no. 1 , pp. 63 - 77 , Feb. 1999 .

M. K. Atlihan and L. Schrage, “Generalized filtering algorithms for infeasibility analysis,” Computers & Operations Research , vol. 35 , no. 5 , pp. 1446 - 1464 , May 2008.

Y. Puranik and N. V. Sahinidis, “Deletion presolve for accelerating infeasibility diagnosis in optimization models,” INFORMS Journal on Computing , vol. 29 , no. 4 , pp. 754 - 766 , Nov. 2017 .

Gurobi Optimization. (2023, Jul.). Gurobi optimizer reference manual. [Online]. Available: https://www.gurobi.com/documentation/

T. Achterberg, “Conflict analysis in mixed integer programming,” Discrete Optimization , vol. 4 , no. 1 , pp. 4 - 20 , Mar. 2007 .

Y. Guan, K. Pan, and K. Zhou, “Polynomial time algorithms and extended formulations for unit commitment problems,” IISE Transactions , vol. 50 , no. 8 , pp. 735 - 751 , Aug. 2018 .

T. Achterberg, R. E. Bixby, Z. Gu et al. , “Presolve reductions in mixed integer programming,” INFORMS Journal on Computing , vol. 32 , no. 2 , pp. 473 - 506 , Apr. 2020 .

X. Guan, S. Guo, and Q. Zhai, “The conditions for obtaining feasible solutions to security-constrained unit commitment problems,” IEEE Transactions on Power Systems , vol. 20 , no. 4 , pp. 1746 - 1756 , Nov. 2005 .

M. Zhang, Z. Yang, W. Lin et al. , “Enhancing economics of power systems through fast unit commitment with high time resolution,” Applied Energy , vol. 281 , p. 116051 , Jan. 2021 .

L. Wei, X. Ai, J. Fang et al. , “Data-augmentation acceleration framework by graph neural network for near-optimal unit commitment,” Applied Energy , vol. 377 , p. 124332 , Jan. 2025 .

M. Zhang, Y. Zhou, M. Xiang et al. , “A methodology for building generation trajectories to balance continuous-time load profiles,” IEEE Transactions on Power Systems , vol. 40 , no. 2 , pp. 1609 - 1622 , Mar. 2025 .

L. Tziovani, L. Hadjidemetriou, and S. Timotheou, “Successive convexification algorithms for optimizing power systems with energy storage models,” IEEE Transactions on Smart Grid , vol. 15 , no. 2 , pp. 1807 - 1820 , Mar. 2024 .

J. T. Holzer, Y. Chen, Z. Wu et al. , “Fast simultaneous feasibility test for security constrained unit commitment,” IEEE Transactions on Power Systems , vol. 38 , no. 4 , pp. 3178 - 3187 , Jul. 2023 .

A. R. Sayed, X. Zhang, G. Wang et al. , “Deep reinforcement learning-assisted convex programming for AC unit commitment and its variants,” IEEE Transactions on Power Systems , vol. 39 , no. 4 , pp. 5561 - 5574 , Jul. 2024 .

A. V. Ramesh and X. Li, “Feasibility layer aided machine learning approach for day-ahead operations,” IEEE Transactions on Power Systems , vol. 39 , no. 1 , pp. 1582 - 1593 , Jan. 2024 .

X. Liu and A. J. Conejo, “Quasi-deterministic proxy for network-constrained stochastic unit commitment,” Journal of Modern Power Systems and Clean Energy , vol. 13 , no. 4 , pp. 1167 - 1175 , Jul. 2025 .

D. Xu, Z. Cai, Q. Cheng et al ., “Security-constrained transmission maintenance optimization considering generation and operational risk costs,” Journal of Modern Power Systems and Clean Energy , vol. 12 , no. 3 , pp. 767 - 781 , May 2024.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

A Survey on Large Language Models Enhanced Reinforcement Learning for Smart Grid

Optimal Scheduling of Data Center Virtual Power Plant in Electricity-Carbon Joint Market Under Uncertainty

Cybersecurity in Virtual Power Plants: A Review of Theoretical Framework, Risk Analysis, and Defense Technologies

LLM-augmented Multi-agent System for Trading Behavior Modeling in Coupled Electricity-Carbon Markets

Multi-agent Bi-level Game Model for Park- level Integrated Energy System Based on Electricity-Carbon Market Collaborative Decision-making Mechanism