A Distributed Algorithm for Distribution Network Reconfiguration

  • Abstract: Distribution network reconfiguration functions by changing the status of sectionalizing and tie switches to reduce network line losses, relieve network overloads, minimize loss of load, or increase hosting capacity for distributed energy resources. Most of the existing work adopt centralized or hierarchical approaches to solve the network reconfiguration problem. This paper propose a distributed scheme for network reconfiguration by leveraging the Alternating Direction Method of Multipliers based approach. In the distributed approach, the switches are represented by edge computing agents who communicates and work collectively with their neighbors to find the optimal reconfiguration solution. This scheme breaks the complex computation tasks required by centralized algorithms into much smaller ones. It also relieves the communication burden by restricting data sharing and communication to neighbor-to-neighbor. Simulation results on a 16-bus distribution test feeder demonstrate that the quality of the distributed solution is comparable to that of the centralized approach.

     

/

返回文章
返回