ScholarMate
客服热线:400-1616-289

Research on security-constrained unit commitment based on an improved ordinal optimization algorithm

Zhang, Zhi*; Xu, Guobin; Yang, Nan
Science Citation Index Expanded
清华大学

摘要

It is of great significance for the development of intermittent renewable energy and the marketization of electricity to study an efficient and accurate algorithm for solving the unit commitment problem with security constraints. Based on the existing constrained ordinal optimization (COO) algorithm, an improved ordinal optimization (OO) algorithm is proposed, which can be applied to solve SCUC problems. In order to solve the rough model and the accurate model, the discrete variable identification strategy and the effective safety constraint reduction strategy are adopted, respectively. Compared with the traditional object-oriented algorithm, the improved object-oriented algorithm not only gives full play to the computational efficiency of the traditional object-oriented algorithm but also further improves the compactness and reduces the computational redundancy. IEEE 118 simulation results verify the correctness and effectiveness of the algorithm.

关键词

constrained ordinal optimization invalid security constraint identification discrete variable identification security-constrained unit commitment wind power