Graph partitioning of power grids considering electricity sharing

Abstract

After the 2011 Great East Japan Earthquake in Japan, which subsequently shut down the nuclear power plant in Fukushima, many researchers who foresee such future threats have been proposing decentralized electricity management systems based on renewable green energy. In this paper, we study a graph partitioning problem of power grids assuming that each microgrid can transfer its electricity surplus to other clusters in a peer-to-peer way. We extend an existing graph partitioning algorithm such that it can check whether a set of clusters are self-sufficient after electricity sharing. Our experiments show that our method can reduce the cost of constructing a microgrid system and that it can produce a resilient graph partition that accommodates time-varying electricity surplus over the year.

Power Network Optimization: A Quantum Approach

“…In the following we outline the mathematical formulation of the graph partitioning problem for a power grid, in which the performance metric is given by the power grid cost. We follow the formulation presented in [7], where minimal cost microgrids (partitions) are used to efficiently share electricity surplus. We first consider the case of no electricity sharing within partitions and then extend this formulation to allow for electricity sharing.…”

“…Abdur Razzaque . [6], [7], [8], [9], [10], [11], [12]. Graph theory has been proposed as an efficient methodology to identify the optimal design of electricity networks [5], [6], [7].…”

“…[6], [7], [8], [9], [10], [11], [12]. Graph theory has been proposed as an efficient methodology to identify the optimal design of electricity networks [5], [6], [7]. Recent advances in both quantum hardware and algorithm development have made it possible to solve problems that can be mapped onto graphs on quantum computers.…”

“…Then, in Section III, we define the power network optimization problem, with and without electricity sharing among nodes of the network. We adopt the graph partitioning problem formulation presented in [7]. In this problem formulation, a graph partitioning approach is used to construct minimal cost microgrids (partitions) for sharing electricity surplus within a power grid.…”

Supervised model predictive control of large‐scale electricity networks via clustering methods

“…[29][30][31][32] Another recently developed approach, named coalitional control, 33,34 is based on the following idea: assuming the network divided into nonoverlapping clusters, each agent accepts to belong to a given cluster until this guarantees it an economic benefit. With specific reference to the clustering of power networks, many other contributions have been proposed, 20,23,[35][36][37] including sparsity-promoting optimization algorithms for damping the interarea oscillations in power networks. 38 Our article focuses on the design of a network partitioning procedure and of a corresponding control architecture, in order to balance unexpected load power variations in large-scale power networks.…”