基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法

doi:10.11930/j.issn.1004-9649.201805095

中国电力 ›› 2018, Vol. 51 ›› Issue (9): 110-117.DOI: 10.11930/j.issn.1004-9649.201805095

基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法

张重实¹, 王高猛², 张檀雍³, 林济铿⁴

1. 国网能源研究院有限公司, 北京 102209;
2. 天津大学智能电网教育部重点实验室, 天津 300072;
3. 国网北京市电力公司检修分公司, 北京 100021;
4. 同济大学电子与信息工程学院, 上海 201804

收稿日期:2018-05-17 修回日期:2018-06-20 出版日期:2018-09-05 发布日期:2018-09-20
作者简介:张重实(1964-),男,硕士,编审,从事电力系统规划、发电能源结构优化与电力信息研究,E-mail:gb0464k5@126.com;王高猛(1992-),男,硕士研究生,从事电力系统的优化与控制、配电自动化研究,E-mail:18720981412@163.com;张檀雍(1993-),男,助理工程师,从事配电网运行检修及配电网优化研究,E-mail:zhangtanyong1993@qq.com;林济铿(1967-),男,博士,教授,从事电力系统稳定性分析及控制、智能电网等研究
基金资助:
国家电网公司科技项目（城市配电网参数辨识与运行分析技术研究，KJ17-1-09）。

A New Method for One-Stage Distribution System Reconfiguration Based on Optimal Flow Algorithm and Mayeda Spanning Tree Algorithm

ZHANG Zhongshi¹, WANG Gaomeng², ZHANG Tanyong³, LIN Jikeng⁴

1. State Grid Energy Research Institute Co., Ltd., Beijing 102209, China;
2. Key Laboratory of Smart Grid of Ministry of Education, Tianjin University, Tianjin 300072, China;
3. State Grid Beijing Maintenance Company, Beijing 100021, China;
4. College of Electronic and Information Engineering, Tongji University, Shanghai 201804, China

Received:2018-05-17 Revised:2018-06-20 Online:2018-09-05 Published:2018-09-20
Supported by:
This work is supported by Science and Technology Project of SGCC (Research on parameter identification and operation analysis technology of urban distribution network, No.KJ17-1-09).

摘要/Abstract

摘要： 针对随机类优化算法用于配网重构计算时间长，而启发式算法用于配网重构存在的低精度解等的缺点，提出一种基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法。该方法利用最优流法从支路交换的候选集中快速确定用于Mayeda生成树算法中用于支路交换的支路，从而既回避了随机进化选择方法进化慢的缺点，又回避了穷举法生成过多的劣树的缺点，等效于采用优化技术局部剔除了部分比当前树更劣的树，而明显加快其最优树的搜索过程。方法的优点是充分利用了最优流方法的快速性、Mayeda生成树算法的解空间的完备性，进行良好的结合实现了两者的优势互补，而提高其计算效率。算例验证了方法的有效性。方法因其快速性及至少得到次优解的特点而具有工程应用价值。

关键词: 配电网, 重构, 最优流法, Mayeda生成树, 快速性, 解空间, 完备性

Abstract: For the problem that the stochastic optimization algorithms have long calculation time and the heuristic algorithm has low accuracy when used for distribution network reconfiguration, this paper presents a new method of one-stage distribution network reconfiguration based on the optimal flow method and Mayeda spanning tree algorithm. The optimal flow method is employed to quickly select the branches that are used for branch exchanging in the Mayeda spanning tree algorithm from the candidate sets of branch exchanging, which avoids the slow evolution problem of the stochastic evolutionary selection method as well as the problem of too many poor trees generated by the exhaustive method, and is equivalent to partially eliminating the trees that are worse than the current tree by using the optimization technique, consequently speeding up the searching process for the optimal tree. The proposed method enjoys the advantages of the efficiency of the optimal flow method and the completeness of the solution space of Mayeda spanning tree algorithm, which are well integrated to improve the computational efficiency. The proposed method has been proved effective by case study and is valuable for engineering application due to its efficiency and its ability to find at least a suboptimal solution.

Key words: distribution network, reconfiguration, optimal flow algorithm, Mayeda spanning tree, efficiency, solution space, completeness

中图分类号:

TM76

张重实, 王高猛, 张檀雍, 林济铿. 基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法[J]. 中国电力, 2018, 51(9): 110-117.

ZHANG Zhongshi, WANG Gaomeng, ZHANG Tanyong, LIN Jikeng. A New Method for One-Stage Distribution System Reconfiguration Based on Optimal Flow Algorithm and Mayeda Spanning Tree Algorithm[J]. Electric Power, 2018, 51(9): 110-117.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: https://www.electricpower.com.cn/CN/10.11930/j.issn.1004-9649.201805095

https://www.electricpower.com.cn/CN/Y2018/V51/I9/110

参考文献

[1] CHEN S, HU W, CHEN Z. Comprehensive cost minimization in distribution networks using segmented-time feeder reconfiguration and reactive power control of distributed generators[J]. IEEE Transactions on Power System, 2016, 31(2):983-993.
[2] COSLOVICH L, FANTI M P. Minimum loss reconfiguration of electrical distribution networks with quality requirements[C]//2013 American Control Conference, 2013.
[3] JABR R A, SINGH R, PAL B C. Minimum loss network reconfiguration using mixed-integer convex programming[J]. IEEE Transactions on Power Systems, 2012, 27(2):1106-1115.
[4] TAYLOR J A, HOVER F S. Convex models of distribution system reconfiguration[J]. IEEE Transactions on Power Systems, 2012, 27(3):1407-1413.
[5] LAVORATO M, FRANCO J F, RIDER M J, et al. Imposing radiality constraints in distribution system optimization problems[J]. IEEE Transactions on Power Systems, 2012, 27(1):172-180.
[6] RAMOS E R, EXPÓSITO A G, SANTOS J R, et al. Path-based distribution network modeling:application to reconfiguration for loss reduction[J]. IEEE Transactions on Power Systems, 2005, 20(2):556-564.
[7] JEON Y-J, KIM J-C, KIM J-O, et al. An efficient simulated annealing algorithm for network reconfiguration in large-scale distribution systems[J]. IEEE Transactions on Power Delivery, 2002, 17(4):1070-1078.
[8] ABDELAZIZ A Y, ELKHODARY S M, OSAMA R A. Distribution networks reconfiguration for loss reduction using the Hyper Cube Ant Colony Optimization[C]//International Conference on Computer Engineering & Systems. IEEE, 2012:79-84.
[9] 林济铿, 刘阳升, 潘毅, 等. 基于Mayeda生成树实用算法与粒子群算法的配网重构[J]. 中国电机工程学报, 2014, 34(34):6150-6158 LIN Jikeng, LIU Yangsheng, PAN Yi, et al. Mayeda spanning tree practical method combined with particle swarm algorithm based distribution system reconfiguration[J]. Proceeding of the CSEE, 2014, 34(34):6150-6158
[10] DAWIT F T, KUO L L. An improved distribution system reconfiguration using hybrid GA with PSO[C]//2015 IEEE 15th International Conference on Environment and Electrical Engineering, 2015:77-82.
[11] 刘佳, 程浩忠, 肖峻, 等. 计及N-1安全准则的智能配电网多目标重构策略[J]. 电力系统自动化, 2017, 41(11):163-168 LIU Jia, CHENG Haozhong, XIAO Jun, et al. A multi-object reconfiguration strategy for smart distribution network considering N-1 security criterion[J]. Automation of Electric Power Systems, 2017, 41(11):163-168
[12] ENACHEANU B, RAISON B, CAIRE R, et al. Radial network reconfiguration using genetic algorithm based on the matroid theory[J]. IEEE Transactions on Power Systems, 2008, 23(1):186-195.
[13] 王毅. 基于改进自适应遗传算法的配电网络重构[J]. 电力自动化设备, 2005, 25(12):45-48 WANG Yi. Refined adaptive genetic algorithm for distribution network reconfiguration[J]. Electric Power Automation Equipment, 2005, 25(12):45-48
[14] 张剑, 何怡刚. 基于无向图所有生成树的网络重构遗传算法[J]. 电力自动化设备, 2017, 37(5):136-141 ZHANG Jian, HE Yigang. Genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration[J]. Electric Power Automation Equipment, 2017, 37(5):136-141
[15] BARAN M E, WU F F. Network reconfiguration in distribution systems for loss reduction and load balancing[J]. IEEE Transactions on Power Delivery, 1989, 4(2):1401-1407.
[16] GOSWAMI S K, BASU S K. A new algorithm for the reconfiguration of distribution feeders for loss minimization[J]. IEEE Transactions on Power Delivery, 1992, 7(3):1484-1491.
[17] 韩学军, 陈鹏, 国新凤, 等. 基于潮流计算的配电网重构方法[J]. 电网技术, 2007, 31(17):60-63 HAN Xuejun, CHEN Peng, GUO Xinfeng, et al. A power flow based reconfiguration method of distribution networks[J]. Power System Technology, 2007, 31(17):60-63
[18] 吴文传, 张伯明. 拟全局最优的配电网实时网络重构法[J]. 中国电机工程学报, 2003, 23(11):69-73 WU Wenchuan, ZHANG Boming. A quasi-global optimal method for real-time network reconfiguration of distribution system[J]. Proceeding of the CSEE, 2003, 23(11):69-73
[19] BOROZAN V, RAJICIC D, ACKOVSKI R. Improved method for loss minimization in distribution networks[J]. IEEE Transactions on Power Systems, 2002, 10(3):1420-1425.
[20] BARAN M E, WU F F. Network reconfiguration in distribution systems for loss reduction and load balancing[J]. IEEE Transactions on Power Delivery, 1989, 4(2):1401-1407.
[21] 林济铿, 潘光, 潘毅, 等. 基于矩阵环和操作的Mayeda生成树实用算法[J]. 中国电机工程学报, 2014, 34(31):5659-5667 LIN Jikeng, PAN Guang, PAN Yi, et al. Practical Mayeda spanning tree method based on matrix exclusive or operation[J]. Proceedings of the CSEE, 2014, 34(31):5659-5667

基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法

A New Method for One-Stage Distribution System Reconfiguration Based on Optimal Flow Algorithm and Mayeda Spanning Tree Algorithm

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	贺春光, 王林峰, 曹媛, 安佳坤, 雷子健, 宋关羽, 冀浩然. 考虑综合收益的多电压等级配电网柔性互联装置协同规划方法[J]. 中国电力, 2025, 58(1): 78-84.
[2]	祝士焱, 许寅, 和敬涵, 王颖. 基于多微电网投影的配电系统协调恢复方法[J]. 中国电力, 2024, 57(9): 224-230.
[3]	张亚健, 陈茨, 薛飞, 马丽, 郑敏. 电制氢协同的含高比例光伏配电网两阶段电压随机优化控制[J]. 中国电力, 2024, 57(8): 23-35.
[4]	孙东磊, 孙毅, 刘蕊, 孙鹏凯, 张玉敏. 计及多层级配电网的分布式新能源最大消纳空间分解测算[J]. 中国电力, 2024, 57(8): 108-116.
[5]	王阳, 马伟东, 刘洎溟, 王博石, 姚凯, 韩伟, 余娟. 基于关联规则与重构误差的二次系统故障检测方法[J]. 中国电力, 2024, 57(8): 159-167.
[6]	凡鹏飞, 李宝琴, 侯江伟, 李嵘, 宋崇明, 林凯骏. 配电网分布式电源经济可承载力评估[J]. 中国电力, 2024, 57(7): 196-202.
[7]	王家武, 赵佃云, 刘长锋, 陈康, 张玉敏. 基于目标级联法的多主体主动配电网自治协同优化[J]. 中国电力, 2024, 57(7): 214-226.
[8]	韩璟琳, 胡平, 侯若松, 陈志永, 李洪涛, 柴园园. 计及多光储一体机的配电网电压优化控制策略[J]. 中国电力, 2024, 57(6): 69-77, 152.
[9]	徐峰亮, 王克谦, 王文豪, 王鹏, 王文烨, 张帅, 赵凤展. 计及激励型需求响应的低压配电网混合储能优化配置[J]. 中国电力, 2024, 57(6): 90-101.
[10]	乔俊峰, 周爱华, 彭林, 王一清, 沈晓峰, 潘森, 杨佩, 黄晨宏. 基于多源数据深度融合的配电网运行评价方法[J]. 中国电力, 2024, 57(6): 193-203.
[11]	胡满琳, 李楠, 李一鸣, 皮志勇, 朱益, 李振兴. 基于负序分量的含光伏电源配电网故障区段定位方法[J]. 中国电力, 2024, 57(5): 188-199.
[12]	张宇, 魏新迟, 冯凯辉, 时珊珊, 孟子涵, 梁媛. 计及分布式光伏承载力的配电网侧独立储能充放电策略[J]. 中国电力, 2024, 57(4): 111-117.
[13]	魏明江, 李鹏, 于浩, 冀浩然, 宋关羽, 习伟. 数字配电网边缘计算模拟实验平台[J]. 中国电力, 2024, 57(3): 12-19.
[14]	焦昊, 殷岩岩, 吴晨, 刘建, 徐春雷, 徐贤, 孙国强. 基于安全强化学习的主动配电网有功-无功协调优化调度[J]. 中国电力, 2024, 57(3): 43-50.
[15]	刘国强, 李国春, 郝亚楠, 李贵海, 吴中杰. 低压直流配电网强弱电弧特征及检测算法[J]. 中国电力, 2024, 57(2): 94-102.

模态框（Modal）标题

基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法

A New Method for One-Stage Distribution System Reconfiguration Based on Optimal Flow Algorithm and Mayeda Spanning Tree Algorithm

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics