• CSCD核心库收录期刊
  • 中文核心期刊
  • 中国科技核心期刊

电力建设 ›› 2019, Vol. 40 ›› Issue (12): 104-112.doi: 10.3969/j.issn.1000-7229.2019.12.013

• 智能电网 • 上一篇    下一篇

具有可行域内Steiner点寻优能力的配电网网架规划方法

施鹏佳1,雷勇1,张林垚1,王秋琳2,刘心2,唐滢淇3,董树锋3   

  1. 1. 国网福建省电力有限公司经济技术研究院,福州市 350012; 2.福建亿榕信息技术有限公司,福州市 350003;3. 浙江大学电气工程学院, 杭州市 310027
  • 出版日期:2019-12-01
  • 作者简介:施鹏佳(1990),男,硕士,研究方向为电网规划设计; 雷勇(1963), 男,教授级高工,研究方向为电力系统规划设计; 张林垚(1980),男,硕士,高级工程师,主要从事电力系统规划工作; 王秋琳(1980),女,高级工程师,主要研究方向为电力系统规划; 刘心(1983),男,学士,主要研究方向为配电网规划; 唐滢淇(1997),男,硕士研究生,研究方向为电力系统规划设计; 董树锋(1982),男,博士, 副教授,通信作者, 研究方向为输配一体化电网分析、配电网建模和分析。
  • 基金资助:
    国家自然科学基金项目(51677165);国网福建省电力有限公司科技项目(52130N16000J)

Distribution Network Planning Method with Feasible Domain-Wide Steiner Point Optimization Capability

SHI Pengjia 1, LEI Yong 1, ZHANG Linyao 1, WANG Qiulin2, LIU Xin2, TANG Yingqi 3, DONG Shufeng3   

  1. 1. Institute of Economics and Technology, State Grid Fujian Electric Power Co., Ltd., Fuzhou 350012, China;2. Fujian Yirong Information Technology Co., Ltd., Fuzhou 350003, China;3. College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
  • Online:2019-12-01
  • Supported by:
    This work is supported by National Natural Science Foundation of China (No. 51677165).

摘要: 文章研究配电网规划中网架规划的问题,提出了一种基于Steiner最小树的配电网网架规划新方法,解决了以往研究中没有考虑到的在规划中引入中间节点,并在可行域内寻优的问题。首先用路径描述方法建立了配电网网架规划的数学模型,然后将该数学模型转换成欧式Steiner最小树问题,并采用模拟退火算法求解。通过在算法中对Steiner点进行启发式搜索,实现了在可行域中搜索中间节点的方法,扩大了中间节点的选取范围,增大了搜索到全局最优解的概率。最后,通过算例分析验证了算法的性能和有效性。

关键词: 配电网规划, 路径描述, Steiner最小树, 模拟退火算法

Abstract: This paper mainly studies the problem of frame planning in distribution network planning. A new planning method for distribution network is proposed on the basis of Steiner Minimum Tree, which is to solve the problems with no consideration in the introduction of intermediate nodes and searching the best solution in the feasible areas in the planning of the previous research. Firstly, this paper establishes a mathematical model of distribution network planning using the path description method. Then it converts the mathematical model into a Euclidean Steiner Minimum Tree problem and uses the simulated annealing algorithm to solve it. By heuristically searching the Steiner point in the algorithm, we have made searching for intermediate nodes in feasible regions possible and we have expanded the selection range of intermediate nodes. In addition, we have also increased the probability of searching for a global optimal solution. Finally, the performance and effectiveness of the algorithm are verified by example analysis.

Key words: distribution network planning, path description, Steiner minimum tree, simulated annealing algorithm

中图分类号: