当前位置: X-MOL 学术Electr. Power Syst. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A decomposition heuristic algorithm for dynamic reconfiguration after contingency situations in distribution systems considering island operations
Electric Power Systems Research ( IF 3.9 ) Pub Date : 2021-03-01 , DOI: 10.1016/j.epsr.2020.106969
Iochane Garcia Guimarães , Daniel Pinheiro Bernardon , Vinicius Jacques Garcia , Magdiel Schmitz , Luciano Lopes Pfitscher

Abstract This paper presents a decision-making model for the dynamic reconfiguration of distribution networks after contingency situations based on formulations of the self-healing problem with islanding. This paper develops a three-stage algorithm. The first stage applies a greedy reconfiguration heuristic, which calculates the criteria values for each viable network configuration in each hour. To address the variety of criteria, the analytic hierarchy process method is applied to define the weights. The second stage addresses the problem statically to reduce the number of configurations and, therefore, the combinations of step 3. In the third stage, the problem is approached dynamically, generating the optimal sequence of topologies for the analyzed period, while considering the time-varying operational conditions of the system. The proposed heuristic significantly reduces the complexity of the problem while minimizing the following criteria: energy not supplied, losses, number of interrupted consumers and switch operations. The physical constraints of the power grid considered in the proposed model are the line limits, protective equipment settings, voltage limits, distributed generators (DG) limits and network radiality. The proposed model is analyzed in different scenarios in the IEEE 123-bus system, modified with the insertion of DGs. The proposed method is compared with a conventional benchmark model.

中文翻译:

考虑孤岛运行的配电系统突发事件后动态重构的分解启发式算法

摘要 本文提出了一种基于孤岛自愈问题公式的配电网络动态重构决策模型。本文开发了一个三阶段算法。第一阶段应用贪婪重新配置启发式算法,计算每小时每个可行网络配置的标准值。为了解决各种标准,应用层次分析法来定义权重。第二阶段静态解决问题以减少配置数量,从而减少步骤 3 的组合。在第三阶段,动态解决问题,生成分析周期的最佳拓扑序列,同时考虑时间 -系统运行条件的变化。所提出的启发式方法显着降低了问题的复杂性,同时最大限度地减少了以下标准:未提供能源、损失、中断的消费者数量和开关操作。建议模型中考虑的电网物理约束是线路限制、保护设备设置、电压限制、分布式发电机 (DG) 限制和网络辐射。所提出的模型在 IEEE 123 总线系统的不同场景中进行了分析,并通过插入 DG 进行了修改。将所提出的方法与传统的基准模型进行比较。建议模型中考虑的电网物理约束是线路限制、保护设备设置、电压限制、分布式发电机 (DG) 限制和网络辐射。所提出的模型在 IEEE 123 总线系统的不同场景中进行了分析,并通过插入 DG 进行了修改。将所提出的方法与传统的基准模型进行比较。建议模型中考虑的电网物理约束是线路限制、保护设备设置、电压限制、分布式发电机 (DG) 限制和网络辐射。所提出的模型在 IEEE 123 总线系统的不同场景中进行了分析,并通过插入 DG 进行了修改。将所提出的方法与传统的基准模型进行比较。
更新日期:2021-03-01
down
wechat
bug