Greedy Algorithm for Routing Power and Source Assignment on a Digital Microgrid

Document Type

Conference Proceeding

Publication Date

7-1-2019

Abstract

In this paper, we propose the Greedy SmAlleSt-cost 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 the matching loads to DERs and the selection of the smallest-cost 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. We compare GRASP with an optimal method based on integer linear programming. GRASP addresses the NP-completeness of the optimal solution while finding paths with comparable costs. GRASP uses heuristics to select match sources and loads and to select the lowest-cost paths in the DMG. We compare the cost achieved by both methods on different test networks to show the trade-offs between lowering complexity and achieving optimal-cost paths. Our results show that GRASP approaches the costs attained by the optimal solution by small margins.

Identifier

85074817569 (Scopus)

ISBN

[9781728129808]

Publication Title

Proceedings 2019 IEEE International Congress on Cybermatics 12th IEEE International Conference on Internet of Things 15th IEEE International Conference on Green Computing and Communications 12th IEEE International Conference on Cyber Physical and Social Computing and 5th IEEE International Conference on Smart Data Ithings Greencom Cpscom Smartdata 2019

External Full Text Location

https://doi.org/10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00141

First Page

761

Last Page

767

Fund Ref

National Sleep Foundation

This document is currently not available here.

Share

COinS