Distributed Optimal Economic Dispatch for Microgrids Considering Communication Delays

This paper investigates the economic dispatch problem of microgrids in a distributed fashion. To address this issue, a delay-free-based distributed algorithm is presented to optimally assign the whole energy demand among local generation units with the objective of minimizing the agminated operation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man, and cybernetics. Systems Jg. 49; H. 8; S. 1634 - 1642
Hauptverfasser: Huang, Bonan, Liu, Lining, Zhang, Huaguang, Li, Yushuai, Sun, Qiuye
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.08.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Communication delays
Computer simulation
Delays
distributed algorithm
Distributed algorithms
economic dispatch (ED)
Economics
Electric power grids
Generators
Microgrids
multiagent systems
Optimization
Power dispatch
Robustness (mathematics)
Sparse matrices
ISSN:2168-2216, 2168-2232
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper investigates the economic dispatch problem of microgrids in a distributed fashion. To address this issue, a delay-free-based distributed algorithm is presented to optimally assign the whole energy demand among local generation units with the objective of minimizing the agminated operation cost. By implementing the proposed algorithm, each component can find its own optimal operations by only requiring local computation and communication. As a result, it enhances the system robustness, flexibility, privacy, etc. More importantly, the time-varying delays model is considered and embedded into the design of our distributed algorithm, such that the components can employ the delays information to achieve the collaborative operation, which are more general and applicable for practical power systems. In addition, we have proved that the proposed algorithm can converge to the global optimal point under some sufficient conditions. Finally, several simulations are provided to demonstrate the correctness and effectiveness of the proposed algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2168-2216
2168-2232
DOI:10.1109/TSMC.2019.2900722