基于改进Dijkstra算法的配电网网架扩展规划

电气工程领域中配电网网架扩展规划的目的是确定最优的配电网网架接线方案。配电网网架扩展规划的本质与最短路径问题有相同之处。作为典型的最短路径求解算法之一的Dijkstra算法,在进行配电网网架扩展规划时,需要建立邻接矩阵,并反复对无序排列的初始数据进行遍历搜索,反复遍历搜索影响了算法的计算速度。针对Dijkstra算法对无序排列的初始数据反复遍历搜索对计算速度造成的影响,基于排序思想,提出了改进Dijkstra算法,以提高Dijkstra算法在进行配电网网架扩展规划时的计算速度,然后根据某10 kV中压配电网网架扩展规划算例,基于全寿命周期概念建立了中压配电网网架扩展规划的数学模型,经算例分析验证了所提方法的有效性。

Distribution Network Grid Expansion Planning Based on Improved Dijkstra Algorithm

The purpose of the distribution network grid expansion planning in the field of electrical engineering is to determine the optimal distribution network grid wiring scheme. The nature of the network expansion plan of the distribution network is similar to the shortest path problem. The Dijkstra algorithm, which is one of the typical shortest path solving algorithms, needs to establish an adjacency matrix and repeatedly traverse the unordered initial data during the expansion network planning of the distribution network. Repeated traversal searches affect the calculation of the algorithm speed. Aiming at the impact of the Dijkstra algorithm on the calculation speed caused by repeated traversal searches of the initial data arranged in disorder, this paper proposes an improved Dijkstra algorithm based on the sorting idea to improve the calculation speed of the Dijkstra algorithm in the distribution network grid expansion planning. Based on a 10 KV medium-voltage distribution network grid expansion planning example, a mathematical model for medium-voltage distribution network grid expansion planning is established based on the concept of full life cycle, and the validity of the proposed method is verified by example analysis.