A Minimal Loss Multi-path Peer-to-Peer Power Routing and Scheduling Algorithm for Energy Internet

This paper presents a Hop Optimized Multi-Exchange Routing and Scheduling (HOMERS) algorithm designed to solve concurrent Peer-to-Peer (P2P) exchanges in the Energy Internet. HOMERS formulates multiple P2P exchanges as a single-step mixed-integer nonlinear programming optimization problem and effectively routes and schedules them. Using graph theory, HOMERS ensures power distribution from each source to its corresponding destination with required equivalent multi-path solutions, without any power flow conflicts. Performance evaluations of HOMER were conducted on randomly generated dense topologies with community sizes ranging from 10 to 400 nodes and were compared against Dijkstra’s algorithm modified to prevent power flow violations. The results in a 400-node network show that HOMERS achieved a 68.29% reduction in the mean number of hops, which translates to a decrease in the total distribution loss. Though Dijkstra was computationally faster in routing for single-path solutions, HOMERS performed better in providing equivalent multi-path solutions for congestion reduction among 400 nodes with a 65.27% reduction in the mean runtime. Thus, the algorithm is scalable, effectively manages congestion with multi-path solutions, and also routes for feasible solutions under heterogeneous and limited distribution capacity constraints.