Effectiveness of Many-To-Many GRASP-Based Routing Algorithms for Power Distribution

Jorge Medina, Zhengqi Jiang, Roberto Rojas-Cessa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we propose three modified versions of the Greedy SmAlleSt-cost Path first (GRASP) algorithm for minimizing the total transmission cost in a digital microgrid (DMG). The Simple Dynamic GRASP (SDG) is a cached-version of GRASP that dynamically updates the available capacity of links. The total path Transmission cost Dynamic GRASP (TDG) is a cached version of GRASP that uses the path's transmission cost as the criteria to select the smallest-cost paths. The Brute Force TDG (BFT) is a cached version of GRASP that explores all paths between loads and sources and selects the smallest-cost paths by evaluating the path's transmission costs. Our results show that SDG achieves the smallest total transmission cost and the fewest unsatisfied loads. Although TDG and BFT may achieve similar total transmission costs to those of SDG and GRASP, our results show that using the path's transmission costs in the selection of the smallest-cost path is not as effective as using the path's link costs. However, in more complex power networks, we show that the cached TDG and BFT yield fewer unsatisfied loads than that of a GRASP implementation without a cache.

Original languageEnglish (US)
Title of host publication2020 IEEE 21st International Conference on High Performance Switching and Routing, HPSR 2020
PublisherIEEE Computer Society
ISBN (Electronic)9781728148465
DOIs
StatePublished - May 2020
Event21st IEEE International Conference on High Performance Switching and Routing, HPSR 2020 - Newark, United States
Duration: May 11 2020May 14 2020

Publication series

NameIEEE International Conference on High Performance Switching and Routing, HPSR
Volume2020-May
ISSN (Print)2325-5595
ISSN (Electronic)2325-5609

Conference

Conference21st IEEE International Conference on High Performance Switching and Routing, HPSR 2020
Country/TerritoryUnited States
CityNewark
Period5/11/205/14/20

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Keywords

  • digital microgrids
  • Dijkstra
  • GRASP
  • power networks
  • Power routing
  • shortest paths

Fingerprint

Dive into the research topics of 'Effectiveness of Many-To-Many GRASP-Based Routing Algorithms for Power Distribution'. Together they form a unique fingerprint.

Cite this