Effective decomposition and co-ordination algorithms for unit commitment and economic dispatch with security constraints

摘要

In this paper, the optimization problem of unit commitment and economic dispatch with security constraints is decomposed into two subproblem: one with integer variable and one with continuous variables. Novel algorithms for effectively co-ordination these two subproblems and for efficiently calculating the co-ordinates are presented. The oscillation mechanism during the co-ordination process is analyses and monotic convergence is achieved in the proposed algorithms. Compared with the conventional Lagrangian relaxation approach, the proposed algorithms perform better in terms of calculation speed, robustness, and convergence property and handling complex constraints. Such advantages are demonstrated through the IEEE 24-node system.