.png){kind=icon}
.png){kind=icon}
Return
Distributed fixed step-size algorithm for dynamic economic dispatch with power flow limits
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-019-2638-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, a discrete-time distributed algorithm is proposed for solving the dynamic economic dispatch problem with active power flow limits and transmission line loss. To avoid the communication burden and implement the algorithm in a favorably distributed manner, the splitting method is used to bypass the centralized updating of the algorithm's parameters, which is unavoidable when implementing conventional Lagrangian methods. The use of a fixed step-size and distributed update enhances the applicability of the algorithm. The performance and effectiveness of the proposed distributed algorithm are verified via numerical studies on the IEEE 14-bus system.
Keywords:
dynamic economic dispatch
distributed optimization
discrete-time algorithm
active power flow limit
transmission line loss
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.6
Papers:
4.9K
Citations:
8.9K