Optimal branch exchange for feeder reconfiguration in distribution networks
Optimal branch exchange for feeder reconfiguration in distribution networks
复制标题
用于配电网馈线重新配置的最佳支线交换
DOI：
10.1109/cdc.2013.6760333
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
S. Low
中科院分区：
文献类型：
--
作者：
Qiuyu Peng;S. Low
馈线重构问题选择开关的开/关状态在配电网络中，以最小化一定的成本，如功率损耗。这是一个混合整数非线性规划，因此很难解决。一种流行的启发式搜索包括重复应用分支交换，其中一些负载从一个馈线转移到另一个馈线，同时保持网络的径向结构，直到没有负载转移可以进一步降低成本。优化每个分支交换步骤本身是一个混合整数非线性规划。在本文中，我们提出了一个有效的算法优化的分支交换步骤。它使用交流潮流模型，是基于最近开发的凸松弛的最优潮流。我们提供了一个界限之间的差距差距的最佳成本和我们的解决方案。我们证明，我们的算法是最佳的电压幅值是相同的，在所有总线。通过对实际配电馈线的仿真，验证了该算法的有效性。
The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. A popular heuristic search consists of repeated application of branch exchange, where some loads are transferred from one feeder to another feeder while maintaining the radial structure of the network, until no load transfer can further reduce the cost. Optimizing each branch exchange step is itself a mixed integer nonlinear program. In this paper we propose an efficient algorithm for optimizing a branch exchange step. It uses an AC power flow model and is based on the recently developed convex relaxation of optimal power flow. We provide a bound on the gap between the optimal cost and that of our solution. We prove that our algorithm is optimal when the voltage magnitudes are the same at all buses. We illustrate the effectiveness of our algorithm through the simulation of real-world distribution feeders.