摘要
提出一种基于有序GBDL树集的改进船舶电网潮流算法,分析该算法执行时间。最终证明:基于有序GBDL树的船舶电网潮流算法的求解总时间等同于采用同样潮流算法的广度优先编号、树的前序、后序编号,优于深度优先编号、树的中序编号;基于有序GBDL树集的船舶电网潮流算法的求解总时间优于上述其他所有编号方法。
An improved power flow algorithm for ship power grid based on ordered GBDL tree sets is proposed.Its time complexity is analyzed.The results show that the total time of the ship power flow algorithm based on the ordered GBDL tree is equivalent to the breadth priority power flow algorithm,the pro-tree algorithm and the post-tree algorithm,and is better than the depth priority power flow algorithm and the mid-tree algorithm.The total time of the ship power flow algorithm based on the ordered GBDL tree is better than those of all the above mentioned numbering method.
作者
侯玉
吴旭生
杨波
冯源
HOU Yu;WU Xusheng;YANG Bo;FENG Yuan(College of Electric Engineering,Naval Engineering University,Wuhan 430033,China;Naval Military Representative Office in a factory,Liaoning Dalian 116005,China)
出处
《船舶工程》
CSCD
北大核心
2018年第10期78-82,109,共6页
Ship Engineering
