A Novel Graph-based Routing Algorithm in Residential Multi-Microgrid Systems
The complementary energy exchange between residential microgrids aims at decreasing the dependence on the main grid, reducing the size and cost of the energy storage units, and increasing energy efficiency. In this regard, the use of a power router interface to connect the microgrids to the power sy...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on industrial informatics 2021-03, Vol.17 (3), p.1-1 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The complementary energy exchange between residential microgrids aims at decreasing the dependence on the main grid, reducing the size and cost of the energy storage units, and increasing energy efficiency. In this regard, the use of a power router interface to connect the microgrids to the power system is necessary for controlling bidirectional power and data flow, which will build the core of the future Energy Internet. In fact, the power router is served as an energy exchange center that enables energy flow between microgrids. One of the most important factors in determining multimicrogrid system performance is the energy routing algorithm strategy. In this article, a new routing algorithm is proposed based on the graph theory. The objective of the proposed algorithm is to minimize the overall power losses with respect to congestion and reliability. Therefore, the best set of loads, optimal sources, and no-congestion minimum loss paths are determined. Various analysis cases have been investigated to confirm the performance and flexibility of the proposed algorithm. A novel case study with multisources and multiloads is addressed, which has not been previously analyzed with the application of power routers. In addition, the developed algorithm is compared with other existing algorithms in terms of power loss minimization, different scenarios, congestion management, computation time, and complexity. |
---|---|
ISSN: | 1551-3203 1941-0050 |
DOI: | 10.1109/TII.2020.2997516 |