一种基于改进最小生成树算法的配电网架优化规划

提出了一种用于配电网络规划的改进最小生成树算法：将配电网的电源点和负荷点当作顶点，将各个顶点间可能架设线路的走廊当作边，将线路的建设费用和运行费用(主要为线损)之和作为各条边的权，在采用基本最小生成树算法获得初步规划方案的基础上，采取动态调整各条边的权值并反复迭代的方法，获得总费用最小的优化规划结果，并采用随机初始权值的处理方法以提高获得全局最优解的机会。首先选中各个电源点间的最短路径、并以不再产生新的环路为约束条件，运用提出的改进最小生成树算法，实现了多供电途径的网格状配电网架规划，讨论了交叉点的处理方法以及在已建成网络的基础上进行扩展规划的方法。规划实例表明文中提出的方法是可行的。

AN IMPROVED MINMUM-COST SPANNING TREE BASED OPTIMAL PLANNING OF DISTRIBUTION NETWORKS

An improved Minimum-Cost Spanning Tree algorithm (MCST) for optimal planning of distribution network is put forward. The source points and load points are regarded as vertexes. The routes, along which, feeder lines might be implanted are regarded as edges. The summation of construction cost and operational cost of each feeder is defined as the weight of the corresponding edge. Based on the preliminary planning results of basic minimum-cost spanning tree algorithm, by adjusting the weights of each edges dynamically and implanting an iteration method, the optimal planning result of the minimum total cost is obtained. An approach of setting up a group of random initial weights is used to search for the global optimal planning. The proposed method is extended into meshed network planning by determination of the shortest routes between each source points before hand and then executing the improved MCST under the condition of no more loops being formed. The way to handle the cross points and expanding planning on the existing network are also discussed. The feasibility of the proposed method is shown by a practical example.