A Systematic Method for Constructing Feasible Solution to SCUC Problem With Analytical Feasibility Conditions

Obtaining high-quality feasible solution is the core and the major difficulty in solving security-constrained unit commitment (SCUC) problems. This paper presents a systematic method for constructing feasible solutions to SCUC problem based on a group of analytical feasibility conditions. The feasibility check is performed based on the analytical necessary conditions such that most of infeasible UC states can be identified without solving LP problem. If a UC state is infeasible, it is adjusted with the possibly minimal operating cost increase based on the cost information. This UC adjusting issue is formulated as a zero-one programming problem and a branch and bound (B&B) method is established based on these feasibility conditions. Numerical testing is performed for a 31-bus system, an IEEE 24-bus system, and an IEEE 118-bus system. The testing results suggest that over 95% of infeasible UC states are identified by the analytical necessary conditions. The near-optimal feasible schedules for SCUC problem can be obtained efficiently by the proposed method. The feasible schedules obtained are compared with those obtained from mixed integer programming-based method in the IEEE 118-bus system. It is shown that the new method can produce competitive results in terms of solution quality and computational efficiency.