论文标题
用于分配网络重新配置的基于树的基于树的遗传算法
A Spanning Tree-based Genetic Algorithm for Distribution Network Reconfiguration
论文作者
论文摘要
本文提出了一种基于树的基于树的遗传算法(GA),用于重新配置电分配系统,以最大程度地减少主动功率损失。由于分销系统的低压水平,功率损耗高且对系统配置敏感。因此,最佳重新配置是分配系统运行的重要因素,以最大程度地减少主动功率损耗。智能和自动化的发电系统能够重新配置,以响应负载水平的变化,以最大程度地减少主动功率损耗。所提出的方法搜索跨越潜在配置树的树,并使用两个步骤使用遗传算法找到最佳的生成树。在第一步中,由GA的初始群体产生的所有分支和领带线的所有无效组合(即,不为某些负载提供功率的切换组合或违反了辐射和连通性条件)。在第二步中,仅针对形成跨越树的组合进行功率流量分析。然后根据主动功率损耗的量确定最佳配置(最佳配置是导致最小功率损耗的配置)。提出的方法是在包括著名的33节点和69节点系统在内的多个系统上实现的。结果表明,与现有方法相比,所提出的方法是准确有效的。
This paper presents a spanning tree-based genetic algorithm (GA) for the reconfiguration of electrical distribution systems with the objective of minimizing active power losses. Due to low voltage levels at distribution systems, power losses are high and sensitive to system configuration. Therefore, optimal reconfiguration is an important factor in the operation of distribution systems to minimize active power losses. Smart and automated electric distribution systems are able to reconfigure as a response to changes in load levels to minimize active power losses. The proposed method searches spanning trees of potential configurations and finds the optimal spanning tree using a genetic algorithm in two steps. In the first step, all invalid combinations of branches and tie-lines (i.e., switching combinations that do not provide power to some of loads or violate the radiality and connectivity conditions) generated by initial population of GA are filtered out with the help of spanning-tree search algorithm. In the second step, power flow analyses are performed only for combinations that form spanning trees. The optimal configuration is then determined based on the amount of active power losses (optimal configuration is the one that results in minimum power losses). The proposed method is implemented on several systems including the well-known 33-node and 69-node systems. The results show that the proposed method is accurate and efficient in comparison with existing methods.