Optimal planning of distribution network modeled connection

To guide the design of distribution network modeled connections, a series of optimal planning methods are presented. As for a grid of the hand in hand type, it is pointed out that the best location of tie line is along the shortest route between the tip sections of the two corresponding feeders. Taking the supplying regions as rows of the bigraph, the optimum scheme for looped grids feeder arrangement with minimum cost is obtained by a minimum weight match algorithm of bigraph. A hybrid method based on the genetic algorithm and minimum weight match algorithm is proposed to get the optimum planning of a grid with multi-segmentations and multi-connections, in which the nodes of the two rows of the bigraph are changed by crossover operation and mutation operation. Tests on a ten-feeder region have proved the feasibility of the planning method proposed.