TY - GEN
T1 - Analytical conditions for determining feasible commitment states of SCUC problems
AU - Zhai, Qiaozhu
AU - Wu, Hongyu
AU - Guan, Xiaohong
PY - 2010
Y1 - 2010
N2 - Security constrained unit commitment (SCUC) is one of the most important daily tasks that independent system operators (ISOs) or regional transmission organizations (RTOs) must accomplish in daily electric power market. Identifying the feasibility of the unit commitment state with security constraints is crucial for solving SCUC problems. If the feasibility of unit commitment state can be identified quickly, the efficiency of SCUC problem-solving methods can be greatly improved. In this paper, a group of analytical conditions for a commitment state to be feasible is established. More importantly, most of the commitment states can be quickly identified as feasible/infeasible by using these conditions. Numerical testing is performed for 2 power grids and the preliminary results shows that over 95% of infeasible commitment states are identified analytically by one of the necessary conditions, and over 74% of feasible commitment states are identified by the analytical sufficient conditions. Also, these conditions provide useful information for obtaining feasible SCUC solutions.
AB - Security constrained unit commitment (SCUC) is one of the most important daily tasks that independent system operators (ISOs) or regional transmission organizations (RTOs) must accomplish in daily electric power market. Identifying the feasibility of the unit commitment state with security constraints is crucial for solving SCUC problems. If the feasibility of unit commitment state can be identified quickly, the efficiency of SCUC problem-solving methods can be greatly improved. In this paper, a group of analytical conditions for a commitment state to be feasible is established. More importantly, most of the commitment states can be quickly identified as feasible/infeasible by using these conditions. Numerical testing is performed for 2 power grids and the preliminary results shows that over 95% of infeasible commitment states are identified analytically by one of the necessary conditions, and over 74% of feasible commitment states are identified by the analytical sufficient conditions. Also, these conditions provide useful information for obtaining feasible SCUC solutions.
KW - Feasibility conditions
KW - Mixed integer linear programming
KW - Security constraints
KW - Unit commitment
UR - https://www.scopus.com/pages/publications/78649531787
U2 - 10.1109/PES.2010.5589728
DO - 10.1109/PES.2010.5589728
M3 - 会议稿件
AN - SCOPUS:78649531787
SN - 9781424483570
T3 - IEEE PES General Meeting, PES 2010
BT - IEEE PES General Meeting, PES 2010
T2 - IEEE PES General Meeting, PES 2010
Y2 - 25 July 2010 through 29 July 2010
ER -