.png){kind=icon}
.png){kind=icon}
Return
Non-Iterative Multi-Area Coordinated Dispatch via Condensed System Representation
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2020.3019828.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Economics
Security
Power systems
Generators
Couplings
Electricity supply industry
Convergence
Coordinated optimization
multi-area economic dispatch (maed)
optimality condition
redundant constraints
system reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W