论文标题
切换设备认知顺序分配系统恢复
Switching Device-Cognizant Sequential Distribution System Restoration
论文作者
论文摘要
本文提出了一个优化框架，用于使用各种开关设备和分配系统修复中的修复过程进行顺序重新配置。与现有研究相比，本文考虑了不同开关设备的类型，功能和操作限制，从而在实践中适用。我们开发了一种新型的多相方法，以找到各种开关设备和修复故障区域的最佳顺序操作。我们考虑断路器，隐藏器，分段器，负载断路器开关和保险丝。切换操作问题分解为两个混合成员线性编程（MILP）子问题。第一个子问题决定了最佳网络拓扑并估计达到该拓扑的步骤数，而第二个子问题则生成一系列开关操作以协调开关。为了修复故障，我们设计了一个MILP模型，该模型可派遣维修人员清除故障并更换融化的保险丝。清除故障后，我们通过生成新的切换操作序列来更新网络的拓扑，并且该过程一直持续到清除所有故障为止。为了提高计算效率，将网络还原算法开发到组线路部分，以便仅在还原网络中存在可切换部分。提出的方法在IEEE 123-BUS和8500-BUS系统上进行了验证。
This paper presents an optimization framework for sequential reconfiguration using an assortment of switching devices and repair process in distribution system restoration. Compared to existing studies, this paper considers types, capabilities and operational limits of different switching devices, making it applicable in practice. We develop a novel multi-phase method to find the optimal sequential operation of various switching devices and repair faulted areas. We consider circuit breakers, reclosers, sectionalizers, load breaker switches, and fuses. The switching operation problem is decomposed into two mixed-integer linear programming (MILP) subproblems. The first subproblem determines the optimal network topology and estimates the number of steps to reach that topology, while the second subproblem generates a sequence of switching operations to coordinate the switches. For repairing the faults, we design an MILP model that dispatches repair crews to clear faults and replace melted fuses. After clearing a fault, we update the topology of the network by generating a new sequence of switching operations, and the process continues until all faults are cleared. To improve the computational efficiency, a network reduction algorithm is developed to group line sections, such that only switchable sections are present in the reduced network. The proposed method is validated on the IEEE 123-bus and 8500-bus systems.
