Algorithmic Study for Power Restoration in Electrical Distribution Networks

Abstract

We study the automated power restoration in electrical distribution networks, from the algorithmic viewpoint. During power outages, blackout sections without faults may be able to be recovered early using the capacity margins of surrounding supply sources. However, remote supply sources must be utilized in cases where the capacity margins of the neighboring supply sources are insufficient for the scale of the power outage, which is called multi-stage power restoration. In multi-stage power restoration, the distribution network subject to control becomes broader, and in addition, even healthy sections are subjected to control. In this study, we give an efficient algorithm which determines whether multi-stage power restoration is needed for power restoration, and in either case, the algorithm calculates the switching procedure which recovers power with the minimum number of switch operations. Our algorithm employs a novel algorithmic technique of combinatorial reconfiguration, which enables to maintain power supply to the healthy sections.