中国电力 ›› 2024, Vol. 57 ›› Issue (10): 12-24, 35.DOI: 10.11930/j.issn.1004-9649.202403022

• 面向现代智慧配电网的二次系统规划 • 上一篇    下一篇

基于压缩开关候选集合的分布鲁棒配电网重构方法

杜浩程1(), 李世龙2,4(), 巨云涛3(), 张晋奇5()   

  1. 1. 中国农业大学 信息与电气工程学院,北京 100083
    2. 电力物联网四川省重点实验室,四川 成都 610095
    3. 北方工业大学 电气与控制工程学院,北京 100144
    4. 国网四川省电力公司电力科学研究院,四川 成都 610095
    5. 山西省能源互联网研究院,山西 太原 030000
  • 收稿日期:2024-03-06 出版日期:2024-10-28 发布日期:2024-10-25
  • 作者简介:杜浩程(1995—),男,硕士,从事配电网运行与优化技术研究,E-mail:595523633@qq.com
    李世龙(1989—),男,博士,工程师,从事配电网运行与控制技术研究,E-mail:981163632@qq.com
    巨云涛(1985—),男,通信作者,教授,从事高比例可再生能源系统的分布自律-集中协同的稳定分析与优化调控技术、分布式协同能量管理系统研究,E-mail:juyuntaomail@163.com
  • 基金资助:
    电力物联网四川省重点实验室开放课题项目(PIT-F-202205)。

A Distributional Robust Distribution Network Reconfiguration Method Based on Compressed Switch Candidate Set

Haocheng DU1(), Shilong LI2,4(), Yuntao JU3(), Jinqi ZHANG5()   

  1. 1. College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China
    2. Power Internet of Things Key Laboratory of Sichuan Province, Chengdu 610095, China
    3. School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China
    4. State Grid Sichuan Electric Power Research Institute, Chengdu 610095, China
    5. Shanxi Energy Internet Research Institute, Taiyuan 030000, China
  • Received:2024-03-06 Online:2024-10-28 Published:2024-10-25
  • Supported by:
    This work is supported by the Opening Fund of Power Internet of Things Key Laboratory of Sichuan Province (No.PIT-F-202205).

摘要:

在大规模多时刻配电网重构(distribution network reconfiguration,DNR)问题中,大量待优化的开关严重降低了配电网重构的求解效率。针对此问题,提出了一种压缩开关候选集合的分布鲁棒配电网重构模型,该模型分为2个阶段,第1阶段以最小化系统有功网损为目标函数,使用最优匹配回路流法压缩开关候选集合,第2阶段以最小化取电成本和开关动作成本之和为目标函数,并构建以电源点容量为限值的机会约束,采用基于Wasserstein球的分布鲁棒方法处理分布式电源的不确定性,利用对偶转换方法对目标函数中的最坏情况期望和机会约束进行确定性转换,将模型转化为一个混合整数二阶锥规划问题。最后,对33节点和辽宁盘锦45节点系统进行了数值实验,证明了所提模型能够有效提升计算效率,与鲁棒模型和随机规划模型相比,决策者可以通过改变样本数量和置信度来调整模型的经济性和保守性。

关键词: 配电网重构, 最优匹配回路流, 分布鲁棒优化, Wasserstein球, 机会约束

Abstract:

In the large-scale multi-moment distribution network reconfiguration (DNR) problem, a large number of switches to be optimized seriously reduces the solution efficiency of distribution network reconfiguration. To address this problem, a distributional robust distribution network reconfiguration model based on a compressed switch candidate set was proposed, which was divided into two stages. The first stage took the minimization of active network loss of the system as the objective function and used the optimal matching loop flow method to compress the switch candidate set; the second stage took the minimization of the sum of the power purchase cost and the switch action cost as the objective function, constructed the chance constraints on the capacity limits of the power point, and adopted a Wasserstein ball-based distributional robust method to deal with the uncertainty of distributed generation. It transformed the model into a mixed-integer second-order conic planning problem by deterministically transforming the worst-case expectation and chance constraints in the objective function by using a dual transformation method. Finally, numerical experiments were conducted on the 33 node and Liaoning Panjin 45 node systems, which proved that the model proposed in this paper could effectively improve the computational efficiency, and the decision maker could adjust the economy and conservatism of the model by changing the number of samples and the confidence level, compared with the robust model and the stochastic planning model.

Key words: distribution network reconfiguration, optimal matching loop flow, distributional robust optimization, Wasserstein ball, chance constraint