基于贪婪算法的配网多阶段快速重构新方法

doi:10.11930/j.issn.1004-9649.202007222

中国电力 ›› 2022, Vol. 55 ›› Issue (6): 33-41.DOI: 10.11930/j.issn.1004-9649.202007222

基于贪婪算法的配网多阶段快速重构新方法

赵胜举¹, 么莉¹, 林济铿², 张旭¹

1. 天津大学电气自动化与信息工程学院，天津　300072;
2. 同济大学电子与信息工程学院，上海　201804

收稿日期:2020-08-07 修回日期:2021-02-18 出版日期:2022-06-28 发布日期:2022-06-18
作者简介:赵胜举(1995—)，男，硕士，从事配网自动化研究，E-mail：1432080607@qq.com;林济铿(1967—)，男，通信作者，教授，从事系统稳定性分析及控制、智能电网研究，E-mail：mejklin@126.com
基金资助:
国家自然科学基金资助项目(基于图论的智能电网电力孤岛的模型和优化，51177107)

Fast Multi-stage Reconfiguration Method for Distribution System Based on Greedy Algorithm

ZHAO Shengju¹, YAO Li¹, LIN Jikeng², ZHANG Xu¹

1. School of Electronic Information Engineering, Tianjin University, Tianjin 300072, China;
2. School of Electrical Engineering, Tongji University, Shanghai 201804, China

Received:2020-08-07 Revised:2021-02-18 Online:2022-06-28 Published:2022-06-18
Supported by:
This work is supported by National Natural Science Foundation of China (Model and Optimization of Power Island in Smart Grid Based on Graph Theory, No.51177107)

摘要/Abstract

摘要： 针对多阶段动态重构计算速度慢的问题，提出一种动态重构新方法。该方法基于给定的寻优尺度参数M，对以开关动作次数最多的两个相继阶段为中心的2M+2个阶段进行各种可能合并，分别对各个合并后的新阶段进行静态重构，然后选择目标函数值最小的合并方案为当前最优合并方案；如此反复迭代，直到目标函数值不再减少且当前解为可行解时，即得到近似最优解。方法在获得与全局最优解近似解的前提下，其计算速度都比全局最优解快近2个数量级。算例表明该方法因其求解的高效性而具有较好的工程应用前景。

关键词: 配网重构, 最优流法, Mayeda生成树, 贪婪算法, 多阶段动态重构

Abstract: Aiming at the slow-speed computation problem of the multi-stage dynamic reconfiguration, a new dynamic reconfiguration method is proposed. Based on the given optimization scale parameter M, the proposed method makes all possible merges for 2M+2 phases which are centered on the two successive phases with the highest number of switching actions, and carries out static reconfiguration for each new merged phase, and then selects the merging scheme with a minimum objective function value as the current optimal merging scheme; repeat the iteration until the objective function value is no longer reduced and the current solution is a feasible solution, thereby obtaining the approximate optimal solution. On the premise of obtaining an approximate solution to the global optimal solution, the calculation speed is nearly 2 orders of magnitude faster than the global optimal solution. Case study shows that the proposed method has good engineering application prospect because of its high efficiency in solution.

Key words: distribution network reconfiguration, optimal flow method, Mayeda spanning tree, greedy algorithm, multi-stage dynamic reconfiguration

赵胜举, 么莉, 林济铿, 张旭. 基于贪婪算法的配网多阶段快速重构新方法[J]. 中国电力, 2022, 55(6): 33-41.

ZHAO Shengju, YAO Li, LIN Jikeng, ZHANG Xu. Fast Multi-stage Reconfiguration Method for Distribution System Based on Greedy Algorithm[J]. Electric Power, 2022, 55(6): 33-41.

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

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

https://www.electricpower.com.cn/CN/Y2022/V55/I6/33

参考文献

[1] 谢琳宇, 唐忠, 黄星宇, 等. 考虑分布式电源和电动汽车不确定性的双层动态配网重构[J]. 电力系统保护与控制, 2020, 48(10): 1–11
XIE Linyu, TANG Zhong, HUANG Xingyu, et al. Bi-layer dynamic reconfiguration of a distribution network considering the uncertainty of distributed generation and electric vehicles[J]. Power System Protection and Control, 2020, 48(10): 1–11
[2] KOUTSOUKIS N C, SIAGKAS D O, GEORGILAKIS P S, et al. Online reconfiguration of active distribution networks for maximum integration of distributed generation[J]. IEEE Transactions on Automation Science and Engineering, 2017, 14(2): 437–448.
[3] 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.
[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] HONG H F, HU Z S, GUO R P, et al. Directed graph-based distribution network reconfiguration for operation mode adjustment and service restoration considering distributed generation[J]. Journal of Modern Power Systems and Clean Energy, 2017, 5(1): 142–149.
[6] 祖国强, 肖峻, 左磊, 等. 基于安全域的配电网重构模型[J]. 中国电机工程学报, 2017, 37(5): 1401–1410
ZU Guoqiang, XIAO Jun, ZUO Lei, et al. A reconfiguration model for distribution network based on security region[J]. Proceedings of the CSEE, 2017, 37(5): 1401–1410
[7] 武鹏, 程浩忠, 刘育权, 等. 考虑合环约束的配电网重构方法[J]. 电力系统自动化, 2017, 41(11): 163–168
WU Peng, CHENG Haozhong, LIU Yuquan, et al. Distribution network reconfiguration method considering loop closing constraints[J]. Automation of Electric Power Systems, 2017, 41(11): 163–168
[8] AZIZIVAHED A, NARIMANI H, NADERI E, et al. A hybrid evolutionary algorithm for secure multi-objective distribution feeder reconfiguration[J]. Energy, 2017, 138: 355–373.
[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]. Proceedings of the CSEE, 2014, 34(34): 6150–6158
[10] 高纯, 于艾清, 丁雨. 基于改进布谷鸟算法的三相不平衡有源配电网重构[J]. 电力系统及其自动化学报, 2020, 32(9): 143–150
GAO Chun, YU Aiqing, DING Yu. Reconfiguration of three-phase unbalanced active distribution network based on improved cuckoo search algorithm[J]. Proceedings of the CSU-EPSA, 2020, 32(9): 143–150
[11] 刘佳, 程浩忠, 肖峻, 等. 计及N-1安全准则的智能配电网多目标重构策略[J]. 电力系统自动化, 2016, 40(7): 9–15
LIU Jia, CHENG Haozhong, XIAO Jun, et al. A multi-objective reconfiguration strategy for smart distribution network considering N-1 security criterion[J]. Automation of Electric Power Systems, 2016, 40(7): 9–15
[12] ZHANG J, YUAN X D, YUAN Y B. A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration[J]. Journal of Modern Power Systems and Clean Energy, 2014, 2(2): 143–149.
[13] 李扬, 韦钢, 马钰, 等. 含电动汽车和分布式电源的主动配电网动态重构[J]. 电力系统自动化, 2018, 42(5): 102–110
LI Yang, WEI Gang, MA Yu, et al. Dynamic reconfiguration of active distribution network considering electric vehicles and distributed generations[J]. Automation of Electric Power Systems, 2018, 42(5): 102–110
[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]. Proceedings of the CSEE, 2003, 23(11): 69–73
[19] 赵静翔, 牛焕娜, 王钰竹. 基于信息熵时段划分的主动配电网动态重构[J]. 电网技术, 2017, 41(2): 402–408
ZHAO Jingxiang, NIU Huanna, WANG Yuzhu. Dynamic reconfiguration of active distribution network based on information entropy of time intervals[J]. Power System Technology, 2017, 41(2): 402–408
[20] 田昊, 吕林, 高红均, 等. 计及电网运行特性的配电网动态重构[J]. 电力系统保护与控制, 2015, 43(1): 9–14
TIAN Hao, LÜ Lin, GAO Hongjun, et al. Dynamic reconfiguration of distribution network considering power grid operation characteristic[J]. Power System Protection and Control, 2015, 43(1): 9–14
[21] 张珂, 吕林, 孙宇乐. 基于隶属度时段划分的配电网动态重构[J]. 电力系统保护与控制, 2016, 44(3): 51–57
ZHANG Ke, LÜ Lin, SUN Yule. Dynamic reconfiguration of distribution network based on membership partition of time intervals[J]. Power System Protection and Control, 2016, 44(3): 51–57
[22] 王淳, 高元海. 采用最优模糊C均值聚类和改进化学反应算法的配电网络动态重构[J]. 中国电机工程学报, 2014, 34(10): 1682–1691
WANG Chun, GAO Yuanhai. Dynamic reconfiguration of distribution network based on optimal fuzzy C-means clustering and improved chemical reaction optimization[J]. Proceedings of the CSEE, 2014, 34(10): 1682–1691
[23] 林济铿, 潘光, 潘毅, 等. 基于矩阵环和操作的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
[24] BOROZAN V, RAJICIC D, ACKOVSKI R. Improved method for loss minimization in distribution networks[J]. IEEE Transactions on Power Systems, 1995, 10(3): 1420–1425.

基于贪婪算法的配网多阶段快速重构新方法

Fast Multi-stage Reconfiguration Method for Distribution System Based on Greedy Algorithm

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics

[1]	王岩, 蒋静, 何恒靖, 高赐威, 肖勇. 基于改进贪婪算法的多场景负荷组合优化[J]. 中国电力, 2020, 53(5): 1-9.
[2]	张重实, 王高猛, 张檀雍, 林济铿. 基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法[J]. 中国电力, 2018, 51(9): 110-117.
[3]	李鹏, 孙充勃, 王成山, 郭小龙, 张飞, 聂耸. 基于OpenDSS的智能配电网仿真与模拟平台及其应用[J]. 中国电力, 2013, 46(11): 12-16.

模态框（Modal）标题

基于贪婪算法的配网多阶段快速重构新方法

Fast Multi-stage Reconfiguration Method for Distribution System Based on Greedy Algorithm

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics