检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩翔宇[1] 刘涤尘[1] 廖清芬[1] 贾骏[1] 朱正[1] 胡静竹[1]
出 处:《电力系统及其自动化学报》2016年第6期62-67,共6页Proceedings of the CSU-EPSA
基 金:国家电网公司科技项目(5211011400BT)
摘 要:不确定性分布式电源的接入,给配电网规划带来新的挑战。首先将含分布式电源的配电网规划归纳为求解斯坦纳树问题,提出了一种新的配电网规划建模方法。其次通过DG供电分区的划定,将分区内的负荷节点处理为一个不接DG的负荷节点,消除DG对配电网规划的影响。针对斯坦纳树问题传统解法求解时间会随着斯坦纳点的规模成倍增加的缺陷,采用一种改进的粒子群优化(PSO)算法解决斯坦纳树N-P完全问题。结合54节点算例并与传统方法计算结果比较,验证了该方法的有效性。The traditional distribution network planning methods are challenged by the access of the uncertain distribut-ed generation. Firstly,the distribution network planning with distributed generation is converted into solving the Steinertree problem and a new distributed network planning model is proposed. Secondly,through the delineation of DG powersupply region,the load buses in the region are processed into one load bus without DG,eliminating the effect of DG onthe distribution network planning. In order to solve the problem that the computing time multiplied as the Steiner nodesincreased,an improved particle swarm optimization(PSO)algorithm is proposed to solve the Steiner tree N-P completeproblem. Typical results of the traditional algorithm and the proposed algorithm are further illustrated and comparedthrough a real 54 nodes system to testify the effectiveness of the methods in this paper.
关 键 词:分布式电源 配电网规划 斯坦纳树 供电分区 改进粒子群优化算法
分 类 号:TM715[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222