Journal of South China University of Technology (Natural Science Edition) ›› 2017, Vol. 45 ›› Issue (4): 44-50,58.doi: 10.3969/j.issn.1000-565X.2017.04.007

• Power & Electrical Engineering • Previous Articles     Next Articles

Improved Probabilistic Load Flow Calculation of Distribution Grids with Distributed Generation

HUANG Yu1 XU Qing-shan1 LIU Jian-kun2 WEI Peng2   

  1. 1.School of Electrical Engineering,Southeast University,Nanjing 210096,Jiangsu,China; 2.Jiangsu Electric Power Research Institute,Nanjing 210003,Jiangsu,China
  • Received:2015-12-24 Revised:2016-05-30 Online:2017-04-25 Published:2017-03-01
  • Contact: 黄煜( 1992-) ,男,博士生,主要从事新能源发电技术、微电网运行与控制等的研究. E-mail:1328835936@qq.com
  • About author:黄煜( 1992-) ,男,博士生,主要从事新能源发电技术、微电网运行与控制等的研究.
  • Supported by:
    Supported by the National Natural Science Foundation of China( 51377021)

Abstract:

With the continuous increase of the proportion of distributed generations ( DG) in distribution grids,power systems face more and more challenges,such as the increase of uncertainty and the change of grid structure.The conventional load flow calculation method is unable to deal with such a great number of uncertainties in grids.In order to solve this problem,a probabilistic load flow calculation method based on the imperialist competitive algorithm ( ICA) is proposed,which can easily take into account all kinds of topology structures,different DG penetration levels and multiple constraint conditions of complicated networks,with good convergence as well.Moreover,for the purpose of improving the searching ability and convergence rate of the algorithm,a clone evolution operator is introduced in ICA.The modified IEEE-33 distribution system is used for simulation and the results are compared with those obtained via Monte Carlo simulation ( MCS) .It is found that the proposed method is of high precision and great practical value.

Key words: probabilistic load flow, smart distribution grid, distributed generation, imperialist competitive algorithm, clone evolution

CLC Number: