首页|拓扑关系重建下的配网调度防误模拟操作优选排序算法

拓扑关系重建下的配网调度防误模拟操作优选排序算法

扫码查看
结构复杂的配网调度中,拓扑关系冗杂,内部线路繁复,排序过程容易陷入局部最优,无法得到全局最优调度方案.对此,设计一种在拓扑关系重建下的配网调度防误模拟操作优选排序算法.为了获取配网拓扑接线图信息,生成拓扑关系重建下的配网接线图,同步分析待重建数据与配网模型.利用Petri网描述配网中调度操作活动,利用动态关联矩阵分析调度防误模拟操作方案.分层计算各方案不同环节下的风险和总体方案的风险,选择风险最小的调度方案完成配网调度防误模拟操作优选排序.测试结果表明,该方法更加接近理论上的优选方案,相对安全,保证了配网调度防误模拟操作过程的完整性和实际应用性.
Optimal Sorting Algorithm for Anti-error Simulation Operation of Distribution Network Scheduling under Topology Relation Reconstruction
In the distribution network scheduling with complex structure,the topology relations are complicated,the internal lines are complicated,the sorting process is easy to fall into local optimal,and the global optimal scheduling scheme cannot be obtained.Therefore,a optimal sorting algorithm for anti-error simulation operation of distribution network scheduling under to-pology relation reconstruction is designed.To obtain the topology diagram information of the distribution network,generate the distribution network diagram under topology relation reconstruction,and synchronously analyze the data to be reconstructed and the distribution network model.Petri net is used to describe scheduling operation activities in distribution network,and dy-namic incidence matrix is used to analyze scheduling anti-error simulation operation scheme.The risks under different links of each scheme and the risks of the overall scheme are calculated hierarchically,and the scheduling scheme with the least risk is se-lected to complete optimal sorting of anti-error simulation operation of distribution network scheduling.The test results show that this method is closer to the theoretical optimal scheme,relatively safe,and ensures the integrity and practical application of anti-error simulation operation process of distribution network scheduling.

topology relation reconstructiondistribution network scheduling simulationsorting

赵家明、严晗、周鑫、赵璇、吴玉生

展开 >

国网江苏省电力有限公司淮安供电分公司,江苏,淮安 223002

北京四方继保自动化股份有限公司,北京 100085

拓扑关系重建 配网调度防误模拟 排序

2024

微型电脑应用
上海市微型电脑应用学会

微型电脑应用

CSTPCD
影响因子:0.359
ISSN:1007-757X
年,卷(期):2024.40(7)