Distributed Networks Planning With DG

With the development of DG, more and more users inject DG into gird independently, which gives a great impact on traditional distributed networks planning. The randomness of DG introduces new problems to grid frames reliability and economy of grid construction. The above means that the research of distributed networks planning with DG includes practical significance.In this thesis, previous procedure, research status, DG output model and impacts on distributed networks frames reliability in distributed networks planning are introduced. In the aspect of planning, computational geometry and heuristic etc. algorithms are used to solve such as load point distribution, flow uncertainty.Firstly, on the basis of extensive reading of domestic and foreign literatures the common planning model of distributed networks is summarized which includes objective function, constraint conditions, method to randomness and solution algorithm.Secondly, the base models of DG are discussed, which highlights randomness of DG and parameters comprehensively and lay the foundation of DG output and random characteristic analysis.Then, on the basis of equivalent power function method, continuous DG output characteristic is deduced to calculate the equivalent failure rate of lines with DG. Based on the equivalent failure rate, SAIDI, SAIFI etc. reliability indexes can be computed which can reflect the reliability of grid frames.Finally, taking advantage of chance constraint programming, this thesis discusses the planning model of distributed networks with DG. The model considers the randomness of DG and load, and debates the load points distribution problem with outlet numbers constraint. Bi-level optimization method is used to simplify the optimal model. Examples prove the validity of model and algorithms.