A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration

• DOI: 10.1007/s40565-014-0056-0
• Publication Date: 2014-06-11T05:14:00Z
• Authors: Jian ZHANG; Xiaodong YUAN; Yubo YUAN
• Keywords: Control reconfiguration; Reverse-delete algorithm

Network reconfiguration is of theoretical and practical significance to guarantee safe economical operation distribution system. In this paper, based on all spanning trees undirected graph, a novel genetic algorithm for electric network proposed. Above all, simplified graph are found. Tie branches obtained with tree subtracted from graph. There one only switch open each tie branch. Decimal identity number branch taken as the optimization variable. Therefore, length chromosome very short. Each corresponds subpopulation. Gene operations subpopulation implemented parallel computing method. Individuals offspring after gene automatically meet radial connected constraints operation. Disadvantages conventional that large amount unfeasible solutions created crossover mutation, which result in low searching efficiency, completely overcome. High calculation speed superior capability proposed method validated by two test cases.