A first step towards resilient graph partitioning for electrical grids

We study a graph partitioning problem for electrical grids such that a given grid is partitioned into multiple ones that are self-contained concerning electricity balance. Our goal is to find a resilient partition against time-changing power demand and supply over the year. In this paper, we investigate two graph partitioning algorithms applying them to a synthesized dataset based on realistic assumptions about Yokohama, Japan. Our initial results show that a simple algorithm, which only considers horizontal or vertical partitions, possibly produces more resilient partitions than a more general algorithm whose partitions divide a graph into subgraphs of any topology.