Expansion planning of distribution networks by heuristic algorithms

The existing distribution networks are growing with complexity more and more, due to the gradual increase of power demand and variation of loads. This paper describes several heuristic algorithms applied to the optimal configuration of loop distribution network. Configuration problems are too complicated and time consumed to be solved. These problems are basically large-scaled combinatorial optimization problems, because an urban distribution system is usually large in scale and contain numerous sectionalizing switches to be operated. It is, therefore, difficult to rapidly obtain an exact optimal solution on real system.