摘要
Abstract
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 .关键词
潮流转移/输电断面/前K最短路径/汽车接力Key words
flow transferring/transmission section/K shortest paths/automotive relay分类
信息技术与安全科学
