Graph partitioning of power grids considering electricity sharing

Author(s):Tomoya Tanjo, Kazuhiro Minami, Hiroshi Maruyama
Institute of Statistical Mathematics, 10-3 Midori-cho, Tachikawa, Tokyo 190-8562, Japan
International Journal of Smart Grid and Clean Energy, vol. 5, no. 2, April 2016: pp. 112-120
ISSN: 2315-4462 (Print)
ISSN: 2373-3594 (Online)
Digital Object Identifier: 10.12720/sgce.5.2.112-120

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.

Keywords:Power grids, distributed electricity power management system, graph partitioning, maximum flow

Full Paper.pdf
Copyright © 2016 International Journal of Smart Grid and Clean Energy, All Rights Reserved