Data-driven Network Reduction for Transmission-Constrained Unit Commitment

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 reduce the computational burden of 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. By disregarding the capacity constraints of potentially uncongested lines we formulate a reduced TC-UC problem that is easier to solve and whose solution is equivalent to the one obtained with the original TC-UC problem. The proposed approach is tested on the IEEE-96 system for different levels of congestion. Numerical results demonstrate that the proposed approach outperforms existing ones by significantly reducing the computational time of the TC-UC problem.

[1]  Jianhui Wang,et al.  Network reduction in the Transmission-Constrained Unit Commitment problem , 2012, Comput. Ind. Eng..

[2]  D. Ruppert The Elements of Statistical Learning: Data Mining, Inference, and Prediction , 2004 .

[3]  Daniel S. Kirschen,et al.  Toward Cost-Efficient and Reliable Unit Commitment Under Uncertainty , 2016, IEEE Transactions on Power Systems.

[4]  R. Sioshansi,et al.  Economic Consequences of Alternative Solution Methods for Centralized Unit Commitment in Day-Ahead Electricity Markets , 2008, IEEE Transactions on Power Systems.

[5]  Pierre Fouilhoux,et al.  On the complexity of the Unit Commitment Problem , 2019, Ann. Oper. Res..

[6]  Xiaohong Guan,et al.  Fast Identification of Inactive Security Constraints in SCUC Problems , 2010, IEEE Transactions on Power Systems.

[7]  Jianhui Wang,et al.  Stochastic Optimization for Unit Commitment—A Review , 2015, IEEE Transactions on Power Systems.

[8]  Daniel K. Molzahn,et al.  Implied Constraint Satisfaction in Power System optimization: The Impacts of Load Variations , 2019, 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Boon Teck Ooi,et al.  Impacts of Wind Power Minute-to-Minute Variations on Power System Operation , 2008, IEEE Transactions on Power Systems.

[10]  Andres Ramos,et al.  Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment , 2013, IEEE Transactions on Power Systems.

[11]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[12]  Mohammad Shahidehpour,et al.  The IEEE Reliability Test System-1996. A report prepared by the Reliability Test System Task Force of the Application of Probability Methods Subcommittee , 1999 .

[13]  J. L. Hodges,et al.  Discriminatory Analysis - Nonparametric Discrimination: Consistency Properties , 1989 .

[14]  D. Streiffert,et al.  A mixed integer programming solution for market clearing and reliability analysis , 2005, IEEE Power Engineering Society General Meeting, 2005.

[15]  Francois Bouffard,et al.  Identification of Umbrella Constraints in DC-Based Security-Constrained Optimal Power Flow , 2013, IEEE Transactions on Power Systems.