基于最小生成树算法的配电网架扩展规划  

Distribution Networks Expansion Planning Based on Improved Minimum-cost Spanning Tree

作　　者：刘健[1] 杨文宇[1] 

机构地区：[1]西安理工大学自动化学院

出　　处：《电力系统自动化》2005年第17期34-39,共6页Automation of Electric Power Systems

基　　金：全国优秀博士学位论文作者专项基金资助项目(200137)~~

摘　　要：基于改进最小生成树算法,提出了一种高效率的配电网扩展规划方法。以最大投资额度为约束条件,以建设费用与运行费用的加权和最低为目标函数,采用prim算法求取最小生成树获得初步规划结果,根据潮流计算结果调整导线截面并计算运行费用,依此反复迭代调整规划网架直至最优。规划过程中考虑了对道路交叉点区别对待,并且只将采用Dijkstral算法获得的顶点间的最短路径作为边,还考虑了拆除线路的残值和拆除费用。对两个典型算例进行了规划,结果表明所提出的方法是可行的且具有较高的效率。Based on the improved minimum-cost spanning tree algorithm （MCST）, a high efficiency approach to optimal expansion planning for the distribution network is put forward. With the maximum investment amount is used as the constraint condition and the minimum weighted summation of the development and the operational cost as the objective function, the minimum-cost spanning tree is obtained as a primary grid using the prim algorithm. Based on load flow calculation, the areas of conductors are adjusted and the operational costs due to line losses are evaluated. An iteration method is used to obtain the optimal result. The street cross points are considered and only the shortest route between two vertices is regarded as an edge. The residual value and costs of removed feeders are also considered in the expanding planning. Two typical examples are given to show that the method proposed is feasible and efficient.

关 键 词：配电网 扩展规划 改进最小生成树算法 

分 类 号：TM715[电气工程—电力系统及自动化] TM727.2