Non-Iterative Multi-Area Coordinated Dispatch via Condensed System Representation

The coordinated multi-area economic dispatch enables optimal resource utilization in a larger spatial range. To overcome drawbacks such as heavy communication burden, convergence failure, and weak scalability of iterative coordination methods, this paper proposes a fully non-iterative multi-area coordination framework. The proposed framework is based on a novel system reduction technique termed as the condensed system representation (CSR). The CSR makes external equivalence of the dispatch problem of each area by exploiting power system operating characteristics, i.e., only a small number of generators may become marginal units and only a minority of security constraints may be active. An algorithm based on the optimality condition analysis is developed to identify the CSR by fixing non-marginal units to their output bounds, eliminating redundant security constraints, and making Norton equivalence of the internal network. With CSRs submitted by local areas, the multi-area system can be optimized without iterative information exchange. Case studies based on a 3-area 9-bus system verify the effectiveness of the CSR-based coordination framework. Larger-scale test systems are constructed to validate the computational efficiency, robustness, and scalability of the proposed method.

Automated summary

This paper proposes a multi-area coordination framework based on condensed system representation (CSR), which can optimize multi-area systems by fixing non-marginal units and eliminating redundant security constraints without the need for iterative information exchange.