摘要
提出了一种基于汽车接力模型的快速搜索输电断面的新算法。首先将电力网络转化成拓扑图,将系统节点、线路阻抗分别视作车站、路径长短,然后利用若干辆相同汽车在始发站和终点站之间的若干站点之间进行按照一定规则的接力赛,由于所走路径越短则油耗量越少,最后将终点站的所有车按剩油量多少排序,即可回溯得到始发站和终点站之间的前K条最短路径,本算法无需派生大量子图,无需多次求解最短路径。引入了基于直流潮流的潮流转移系数,分别计算搜到路径所包含的各条线路的潮流转移系数,将大于某一值的线路加入到输电断面中,最终得到精确的无漏选的输电断面集合。避免了只搜索单一路径的范围太小,而使部分支路漏选。最后对IEEE30节点系统进行仿真分析,验证了该算法的有效性。
A new algorithm based on automotive relay model is presented to quickly search the transmission section. Firstly, the power network can be turned into a topology, with nodes as stations and line impedance as path length. Secondly, according to certain rules, several cars of the same type take part in a relay between originating and termi- nal station. Thirdly, as fuel consumption is proportional to the path length, and cars could be sorted according to its remaining amount of gasoline, which means K shortest paths could be searched through backtracking. Large amounts of sub graphs don＇ t need deriving, and the shortest paths could be got without repeatedly solving. The DC power flow transferring coefficient is introduced, and the coefficients of each branch in the paths searched are calculated. And the branches whose coefficient above certain value should join the transmission sections and an accurate transmission sec- tion set without leaking lines is reached. Compared to the usage of a single path whose search range is too small, the automotive relay algorithm could avoid leaking lines and ensure integrity of transmission section. Finally, an IEEE30 node system simulation is analyzed, which demonstrates the effectiveness of the algorithm.
出处
《电测与仪表》
北大核心
2015年第15期34-40,共7页
Electrical Measurement & Instrumentation
关键词
潮流转移
输电断面
前K最短路径
汽车接力
flow transferring, transmission section, K shortest paths, automotive relay
