一种基于解空间划分的配电网最优重构算法  

An Optimal Distribution Network Reconfiguration Algorithm Based on Division of Solution Space

作　　者：欧帝宏[1] 陈皓勇[1] 何瑞辉[2] 

机构地区：[1]华南理工大学电力学院,广东省广州市510640 [2]中国南方电网海南电网公司,海南省海口市570100

出　　处：《电网技术》2012年第3期140-145,共6页Power System Technology

基　　金：教育部新世纪优秀人才支持计划项目(NCET080207)~~

摘　　要：提出了一种基于解空间划分的配电网最优重构算法。根据配电网不同拓扑结构上的共同点,制定一个划分规则,将配电网重构的整个解空间划分为不同的可行子空间和不可行子空间,排除不可行子空间,同时使用局部寻优算法找出各可行子空间中的最优解,逐一计算网损并进行比较,找出全局最优解。该算法能够确定地得到配电网重构最优解,且显著减少了需要计算网损的候选解数目,使计算效率能够满足实际需要,PG&E69节点系统和IEEE 33节点系统的算例结果与分析证明了该结论。An optimal reconfiguration algorithm for distribution network is proposed. According to the common ground in different topological structures of distribution networks, a division rule is drafted： the whole solution space of distribution network reconfiguration is divided into feasible subspaces and infeasible subspaces, infeasible subspaces are deleted, meanwhile the optimal solutions in feasible subspaces are found out by local search algorithm, then the network losses are calculated one after another and calculation resuls are compared to find out global optimal solution. Using the proposed algorithm, the optimal solution for reconfiguration of distribution network can be achieved determinately and number of candidate solutions by which the network losses are calculated can be evidently reduced, thus the calculation efficiency can meet actual requirement. This conclusion is verified by calculation results of PG＆E 69-bus system and IEEE 33-bus system.

关 键 词：关键词 配电网络 改进穷举法 最优重构 解空间划分 局部寻优算法 

分 类 号：TM715[电气工程—电力系统及自动化]