基于Dijkstra算法的配电网孤岛划分

针对传统孤岛划分方法存在的没有合理利用电网拓扑结构、算法搜索性能差等问题，提出了一种基于Dijkstra算法的配电网孤岛划分方法。首先，采用Dijkstra算法得出DG到重要负荷的最短路径，在满足孤岛划分约束条件的情况下，将含有重要负荷的路径划分入孤岛。然后，根据所得孤岛的邻接关系和负荷节点优先级，在孤岛安全稳定运行的前提下，逐步将更多的负荷划入孤岛。该方法能够充分发挥DG的供电能力，并且具有较好的搜索能力，不仅可以在最大程度上保证重要负荷的供电，而且能够有效计及联络开关的作用。最后，通过算例验证了算法可以有效地处理配电网孤岛划分问题。

Island partition of the distribution system based on Dijkstra algorithm

Traditional island partition method does not use network topology properly, has bad searching performance, etc. Aiming at these problems above, this paper proposes an island partition method for distribution system based on Dijkstra algorithm. Firstly, the shortest path from DG node to important load node is found out by using Dijkstra algorithm. On meeting the constraint condition of islanded partition, the paths containing important loads are preferentially incorporated into island. Secondly, under satisfying safety and stability operation of island, more loads are incorporated into island gradually based on adjacent relation and load priority of the obtained islands. The proposed method can give full play to power supply capability of DG and has a good searching ability; it not only ensures power supply of the important load to maximum extent, but also considers the function of connective switch. Finally, the example analysis shows that the proposed method can solve the problem of distribution system island partition effectively.