文章摘要
李学平,宋国彬,卢志刚.基于改进引力—斥力算法的配电网馈线单线图分块布局[J].电力系统自动化,2017,41(23):117-122. DOI: 10.7500/AEPS20170613004.
LI Xueping,SONG Guobin,LU Zhigang.Partitioned Automatic Layout of Single-line Diagrams for Distribution Network Feeders Based on Improved Repulsion-tension Algorithm[J].Automation of Electric Power Systems,2017,41(23):117-122. DOI: 10.7500/AEPS20170613004.
基于改进引力—斥力算法的配电网馈线单线图分块布局
Partitioned Automatic Layout of Single-line Diagrams for Distribution Network Feeders Based on Improved Repulsion-tension Algorithm
DOI:10.7500/AEPS20170613004
关键词: 配电网  单线图自动布局  图形分块  引力—斥力
KeyWords: distribution network  automatic layout of single-line diagrams  graphics blocking  repulsion-tension
上网日期:2017-08-29
基金项目:国家自然科学基金资助项目(61473246);河北省自然科学基金资助项目(E2015203294);中国博士后科学基金资助项目(2014M551049)
作者单位E-mail
李学平 电力电子节能及传动控制河北省重点实验室(燕山大学), 河北省秦皇岛市 066004 lixueping@ysu.edu.cn 
宋国彬 电力电子节能及传动控制河北省重点实验室(燕山大学), 河北省秦皇岛市 066004  
卢志刚 电力电子节能及传动控制河北省重点实验室(燕山大学), 河北省秦皇岛市 066004  
摘要:
      配电网馈线单线图有时需要根据拓扑连接关系生成,既要获得良好布局效果又要满足成图的快速性,为此提出一种基于改进引力—斥力算法的分块布局方法。首先,确定配电网主干线,基于主干线对电网进行分块布局,以降低维度、提高计算效率;其次,块内布局时对引力—斥力算法加以改进,即根据深度优化分支节点并改进主干线节点质量与距离,使线路分布均匀、避免与主干线过近及减少交叉;最后,为了避免相邻分块的分支交叉,对每个分块添加虚拟节点,优化边界分支布局。对算法优化前后图形效果进行了对比,并给出图形分块对时间的影响,仿真结果表明馈线单线图布局清晰、交叉点少,算法计算时间短,能够满足用户需求。
Abstract:
      Single-line diagrams of distribution network feeders sometimes need to be generated through the topology connection. Generally, the generation of single-line diagrams requires clear layout and fast computing speed. A method of partitioned automatic layout based on the improved repulsion-tension is proposed. Firstly, the trunk line of the power distribution network is determined to put the grid into blocks for reducing the dimension and increasing the computational efficiency. Secondly, the repulsion-tension algorithm is modified in the block to distribute the line evenly, avoid proximity to the trunk line and intersect, optimize branch nodes depending on the depth, and modify the quality and interval of the trunk line. Finally, in order to avoid the intersection of two adjacent blocks, the boundary branch layout is optimized and virtual points are added to each chunk. Graphics of the algorithm are compared before and after the optimization and the impact of the block on time is also presented. Simulation results show that the requirements of users are met by clear layout, fewer junctions of distribution network feeders and shorter computation time of the algorithm.
查看全文(Free!)   查看附录   查看/发表评论  下载PDF阅读器