The Model For Urban Distribution Networks Planning With Consideration Of The Circumstance Constraints And Its Genetic Algorithm

With the development of city, the request of road sights is increasing. The cables are used frequently in the distribution networks planning (DNP) of some areas such as the center of city, shopping center, large-scale and medium-scale residential areas. There are several lying modes, which depend on many factors. Not considering particularly the demands of geography and the difference of investment, which caused by different lying modes in the prevalent methods, the result is unfit to the actual system. Therefore, introducing the circumstance factors to the mode of DNP, considering sufficiently the line corridor having effect on distribution network structure and improving the practical value of project totally have important academic and realistic meaning. Combining with the scientific researching project 《the Power Planning of Jiangbei Cheng Chongqing》, this paper has proposed a model of cyber DNP considering the circumstance constraints, and studied GA applying to the model. In a word, the main content is as following:(1) A model of cyber DNP considering the circumstance constraints is put forward. Adding the building cost of line corridor to the object function, and considering the demands of road and the restriction of cable amount, which caused by different lying modes, the line corridor, the lying modes and the distribution network structure planning are combined effectively.(2) The GA for DNP with consideration of the road information is proposed. In the paper, the road information is described by defining the node information matrix and side information matrix and coding and decoding are implemented by defining and forming branch information matrix. After getting these information matrixes, the initialization, crossover operator and mutation operator are implemented. When the step of crossover, edge recombination crossover algorithm is adopted and in the one of mutation, we take shortest path choosing arithmetic of electrical branches and mutating arithmetic of electrical nodes. In the whole process of genetic operating, the radiant and connective constraints of the network structure are always ensured, the restriction of the cables number are satisfied as well. The capability constraint of branches and transformer substation, the security constraint of node voltage are dealt with by the penalty function of individual fitness, by which the problem of individual constraints is solved effectively.(3) This paper implements the network structure planning of Medium Voltage...