Next Article in Journal
An Improved Signal Processing Approach Based on Analysis Mode Decomposition and Empirical Mode Decomposition
Next Article in Special Issue
An Effective Passive Islanding Detection Algorithm for Distributed Generations
Previous Article in Journal
Design of Cable Termination for AC Breakdown Voltage Tests
Previous Article in Special Issue
Sensor-Based Early Activity Recognition Inside Buildings to Support Energy and Comfort Management Systems
Open AccessArticle

Greedy Algorithm for Minimizing the Cost of Routing Power on a Digital Microgrid

1
Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA
2
Department of Electrical Engineering, City College of City University of New York, New York, NY 10031, USA
*
Author to whom correspondence should be addressed.
Energies 2019, 12(16), 3076; https://doi.org/10.3390/en12163076
Received: 22 June 2019 / Revised: 25 July 2019 / Accepted: 30 July 2019 / Published: 9 August 2019
In this paper, we propose the greedy smallest-cost-rate path first (GRASP) algorithm to route power from sources to loads in a digital microgrid (DMG). Routing of power from distributed energy resources (DERs) to loads of a DMG comprises matching loads to DERs and the selection of the smallest-cost-rate path from a load to its supplying DERs. In such a microgrid, one DER may supply power to one or many loads, and one or many DERs may supply the power requested by a load. Because the optimal method is NP-hard, GRASP addresses this high complexity by using heuristics to match sources and loads and to select the smallest-cost-rate paths in the DMG. We compare the cost achieved by GRASP and an optimal method based on integer linear programming on different IEEE test feeders and other test networks. The comparison shows the trade-offs between lowering complexity and achieving optimal-cost paths. The results show that the cost incurred by GRASP approaches that of the optimal solution by small margins. In the adopted networks, GRASP trades its lower complexity for up to 18% higher costs than those achieved by the optimal solution. View Full-Text
Keywords: digital microgrid; power grid; integer linear programming; routing energy; distributed energy resources; Dijkstra algorithm; integer linear programming digital microgrid; power grid; integer linear programming; routing energy; distributed energy resources; Dijkstra algorithm; integer linear programming
Show Figures

Figure 1

MDPI and ACS Style

Jiang, Z.; Sahasrabudhe, V.; Mohamed, A.; Grebel, H.; Rojas-Cessa, R. Greedy Algorithm for Minimizing the Cost of Routing Power on a Digital Microgrid. Energies 2019, 12, 3076.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map

1
Back to TopTop