Optimal Planning Of Cable Based City Distribution Networks

The planning and design of distribution network become more and more important. Tomeet the demand of city development, the optimization approach of planning for hand-inhandcable distribution networks is investigated in this thesis.The cable channals are planned in the first step, which is used as one of the constraints ofthe cable layout planning. In the planning of cable channals, the load points are regarded asvertexes and the possible routes are regarded as edges. The construction costs are regarded asweights of the corresponding edges. The minimal spanning tree approach is introduced toobtain the optimal planning scheme with the minimum costs. An improved algorithm ofbranch-cutting minimal spanning tree is suggested to solve the problem of road crosses.To meet the requirement of hand-in-hand mode, the area supplied by the correspondingtwo cables are defined as a accompany district. A street district is considered as the minimumunit, based on which, a heuristc approach is used to divide the accompany districts with theindex of load balanceing.A minimum weight matching algorithm is proposed to solve the problem of power sourcemanagement for cables, which is restrained to the number of the feeders of the substations. Aaccompany district is supplied by two cables from two different substations. The ihe ndex is tomake the cost as less as possible. The routes of the cables and the looped points are alsoworked out.On the basis of above approaches, the computer aided optimal planning software of citycable distribution networks is programmed on the platform of MATLAB. An typical exampleis given to test the software, the results of which shows that the proposed approaches arefeasible and the software is a great help for cable distribution network planning.