摘要
针对主动配电网拓扑多样而选取最优拓扑难的问题,提出了一种满足N-1安全约束的主动配电网拓扑控制方案的求解算法。该算法从AC OPF角度考虑,对基于N-1安全约束的主动配电网拓扑选择问题,提出了采用半正定规划松弛作为问题目标函数值的下限的方法,并采用并行计算,极大地提高了计算效率,具有较好的全局最优解。IEEE 30节点测试系统仿真结果表明,所提方法得到的新拓扑不仅可以在不增加任何电气设备的前提下降低系统的运行成本,而且能够满足N-1安全约束。
In order to solve the problem of selecting the optimal topology for active distribution network with various topologies,an algorithm for solving the topology control scheme of active distribution network satisfying N-1 security constraints is proposed in this paper. Considering from the perspective of AC OPF,this algorithm proposes a method of using semi-definite programming relaxation as the lower limit of the objective function value of the problem for active distribution network topology selection based on N-1 security constraints. Parallel computation is adopted,which greatly improves the computational efficiency and has a better global optimal solution. The simulation results of IEEE 30-bus test system show that the proposed new topology can not only reduce the operating cost of the system without adding any electrical equipment,but also meet the N-1 security constraints.
作者
杨德州
任彦辉
葛磊蛟
王洲
徐铭
杨昌海
Yang Dezhou;Ren Yanhui;Ge Leijiao;Wang Zhou;Xu Ming;Yang Changhai(Economics and Technology Research Institute,State Grid Gansu Electric Power Company,Lanzhou 730050,China;Key Laboratory of Smart Grid of Ministry of Education,Tianjin University,Tianjin 300072,China)
出处
《电测与仪表》
北大核心
2020年第1期49-54,共6页
Electrical Measurement & Instrumentation
基金
国网甘肃省电力公司科技项目“基于敦煌国家级高比例新能源示范城市的主动配电网优化规划研究”(52273018000L)
关键词
N-1原则
最优拓扑控制
半正定规划
并行计算
N-1 principle
optimal topology control
semi-definite programming
parallel computing
