| 引用本文: | 王乙斐,唐 飞,刘涤尘,廖清芬,杨 健,汪颂军.基于Dijkstra算法的最优解列断面快速搜索方法[J].电力自动化设备,2015,35(4): |
| WANG Yifei,TANG Fei,LIU Dichen,LIAO Qingfen,YANG Jian,WANG Songjun.Quick search of optimal splitting surface based on Dijkstra algorithm[J].Electric Power Automation Equipment,2015,35(4): |
|
| 摘要: |
| 如何快速确定合理的解列地点，是解列控制实施的关键。针对该问题，提出基于Dijkstra算法的最优解列断面搜索方法。该方法以Dijkstra算法求取节点间最小电抗累加和路径，依据各节点间的电气联系强弱程度，将节点划分为公共节点与一般节点；凭借解列断面与公共节点的联系，将解列断面的搜索转换为公共节点的处理问题，缩小了预搜索空间的规模；以解列后子系统中有功不平衡功率最小为目标函数，基于宽度优先搜索算法完成对公共节点集的搜索分配，获取最优解列断面。仿真算例表明，所提方法既能在考虑节点间电气联系的情况下缩小原始的求解空间，避免化简过程中可行解的丢失，又能适应系统运行方式的变化，满足快速性与有效性要求。 |
| 关键词: 电力系统 主动解列 Dijkstra算法 不平衡功率 最优断面 搜索 解列 |
| DOI： |
| 分类号: |
| 基金项目:中国博士后科学基金资助项目（2014M552080）；含交直流混合多级微电网的国家级兰州新区智能电网综合建设工程之微电网实验系统开发（5227221350BR） |
|
| Quick search of optimal splitting surface based on Dijkstra algorithm |
|
WANG Yifei,TANG Fei,LIU Dichen,LIAO Qingfen,YANG Jian,WANG Songjun
|
|
School of Electrical Engineering，Wuhan University，Wuhan 430072，China
|
| Abstract: |
| A method of optimal splitting surface search is proposed to fast determine the rational splitting location，which applies Dijkstra algorithm to obtain the inter-node path with the minimum accumulative reactance. A node is defined as a public or normal node according to its electrical connection with other nodes. In order to reduce the search space，the connection between the splitting surface and the public node is used to convert the splitting surface search into the public node management. With the minimum unbalanced active power of the sub-system after splitting as the objective function，the public node set is searched and distributed by the breadth-first search algorithm to get the optimal splitting surface. Case simulation shows that，the proposed method has smaller original search space due to the consideration of electrical connection between nodes，avoiding the loss of feasible solution during simplification，and adapts to the change of system operating mode，satisfying the requirement of rapidity and effectiveness. |
| Key words: electric power systems controlled islanding Dijkstra algorithm unbalanced power optimal splitting surface search splitting |
