Distributionally Robust Unit Commitment with N- k Security Criterion and Operational Flexibility of CSP

In order to reduce the conservatism of the robust optimization method and the complexity of the stochastic optimization method and to enhance the ability of power systems to deal with occasional line fault disturbance, this paper proposes a distributionally robust unit commitment (DRUC) model with concentrating solar power (CSP) operational flexibility and N- k safety criterion under distributed uncertainty. According to the limited historical sample data, under the condition of satisfying a certain confidence level, based on the imprecise Dirichlet model (IDM), an ambiguity set is constructed to describe the uncertainty of transmission line fault probability. Through the identification of the worst probability distribution in the ambiguity set, the adaptive robust optimal scheduling problem is transformed into a two-stage robust optimization decision model under the condition of deterministic probability distribution. The CSP flexibility column and constraint generation (C&CG) algorithm is used to process the model and the main problem and subproblem are solved by using the Big-M method, linearization technique, and duality principle. Then, a mixed integer linear programming problem (MILP) model is obtained, which effectively reduces the difficulty of solving the model. Finally, case studies on the IEEE 14 bus system and the IEEE 118 bus system demonstrate the efficiency of the proposed method, such as enhancing the ability of power systems to cope with occasional line fault disturbances and reducing the conservatism of the robust optimization method.