A first step towards resilient graph partitioning for electrical grids

• Published in: 7th International Conference on Information and Automation for Sustainability pp. 1 - 6
• Main Authors: Arizumi, Nana, Minami, Kazuhiro, Tanjo, Tomoya, Maruyama, Hiroshi, Murakami, Daisuke, Yamagata, Yoshiki
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-12-2014
• Subjects: Approximation algorithms; Cities and towns; Clustering algorithms; Electrical grids; Electricity; graph partition; Microgrids; Partitioning algorithms; Power transmission lines; resilience
• ISSN: 2151-1802; 2151-1810
• DOI: 10.1109/ICIAFS.2014.7069608

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.