A Distributed Algorithm for Distribution Network Reconfiguration

Distribution network reconfiguration algorithms change 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 hierarch...

Full description

Saved in:
Bibliographic Details
Published in:2018 China International Conference on Electricity Distribution (CICED) pp. 1730 - 1734
Main Authors: Gao, Yuanqi, Wang, Peng, Yu, Nanpeng
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2018
Subjects:
Conferences
Control systems
Convex functions
Distributed algorithms
distributed optimization
Distribution network reconfiguration
Load flow
Mathematical model
mixed-integer programming
Optimization
ISSN:2161-749X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distribution network reconfiguration algorithms change 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 proposes a distributed scheme for network reconfiguration. In the distributed approach, the switches are represented by edge computing agents who communicate 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 and data sharing burden via neighbor-to-neighbor communication. 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.
ISSN:2161-749X
DOI:10.1109/CICED.2018.8592171