基于改进最小生成树算法并考虑负荷不确定性的配电网架最优规划  

OPTIMAL DISTRIBUTION NETWORK PLANNING BASED ON IMPROVED MINIMAL COST SPANNING TREE ALGORITHM AND CONSIDERING INDETERMINACY OF POWER LOADS

作　　者：刘健[1] 杨文宇[2] 余健明[2] 燕飞[2] 

机构地区：[1]西安科技大学电气与控制工程学院,陕西省西安市710054 [2]西安理工大学自动化与信息工程学院,陕西省西安市710048

出　　处：《电网技术》2005年第16期61-65,共5页Power System Technology

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

摘　　要：为在规划过程中考虑负荷的不确定性,提出了一种新的配电网规划优化方法。将不确定性负荷分为单条件负荷和多条件负荷两类。对于所有负荷都是单条件负荷的情形,根据流过各条边的电流的二阶原点矩确定各条边的权,在此基础上利用改进最小生成树算法获得最优规划方案。对于规划区域中存在多条件负荷的情形,将各个多条件负荷的各种可能性进行组合构成场景,对于每一个场景采用单条件负荷规划方法获得初步网架和初始费用,并分别计算该初步网架在各个场景下的补偿费用,选取初始费用与补偿费用之和的数学期望最小的方案为最优规划方案。算例分析表明了该配电网规划方法的可行性。To consider the indeterminacy of loads during the planning process, a new distribution network planning optimization method is proposed. Dividing indeterminate load into two categories, i.e., the single condition loads and the multi-condition loads. In the case of all loads being single condition loads, the weights of the edges are determined by the second order moments of the corresponding currents passing through the edges, on this basis the optimal planning is obtained by use of improved minimum-cost spanning tree based algorithm. In the case of existing multi-condition loads in the planned region, the possibilities of all multi-condition loads is combined to compose multi-scenario, for each scenario the initial network and initial cost is obtained by use of single condition load planning method, and the compensation costs of the initial network under different scenarios are calculated respectively, and the optimal plan is the one with the minimum expectation of summation of initial cost and compensating cost. Numeric example results show that the proposed distribution planning method is feasible.

关 键 词：配电网规划 不确定规划 多场景 改进最小生成树算法 输配电工程 电力系统 

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