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

被引:30
作者
Zhang, Jian [1 ]
Yuan, Xiaodong [1 ]
Yuan, Yubo [1 ]
机构
[1] Jiangsu Elect Power Co, Res Inst, Nanjing 211103, Jiangsu, Peoples R China
关键词
Network reconfiguration; Genetic algorithm; Paralleling computing; All spanning trees of undirected graph; Decimal coding; Distribution network;
D O I
10.1007/s40565-014-0056-0
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
080906 [电磁信息功能材料与结构]; 082806 [农业信息与电气工程];
摘要
Network reconfiguration is of theoretical and practical significance to guarantee safe and economical operation of distribution system. In this paper, based on all spanning trees of undirected graph, a novel genetic algorithm for electric distribution network reconfiguration is proposed. Above all, all spanning trees of simplified graph of distribution network are found. Tie branches are obtained with spanning tree subtracted from simplified graph. There is one and only one switch open on each tie branch. Decimal identity number of open switch on each tie branch is taken as the optimization variable. Therefore, the length of chromosome is very short. Each spanning tree corresponds to one subpopulation. Gene operations of each subpopulation are implemented with parallel computing method. Individuals of offspring after gene operation automatically meet with radial and connected constraints for distribution network operation. Disadvantages of conventional genetic algorithm for network reconfiguration that a large amount of unfeasible solutions are created after crossover and mutation, which result in very low searching efficiency, are completely overcome. High calculation speed and superior capability of the proposed method are validated by two test cases.
引用
收藏
页码:143 / 149
页数:7
相关论文
共 21 条
[1]
Bi Pengxiang, 2001, Automation of Electric Power Systems, V25, P54
[2]
Bi Pengxiang, 2002, Automation of Electric Power Systems, V26, P57
[3]
Chen Gen-jun, 2002, Proceedings of the CSEE, V22, P28
[4]
DISTRIBUTION FEEDER RECONFIGURATION FOR LOSS REDUCTION [J].
CIVANLAR, S ;
GRAINGER, JJ ;
YIN, H ;
LEE, SSH .
IEEE TRANSACTIONS ON POWER DELIVERY, 1988, 3 (03) :1217-1223
[5]
FINDING ALL SPANNING TREES OF DIRECTED AND UN-DIRECTED GRAPHS [J].
GABOW, HN ;
MYERS, EW .
SIAM JOURNAL ON COMPUTING, 1978, 7 (03) :280-287
[6]
Ge Shao-yun, 2004, Power System Technology, V28, P22
[7]
He Yuqing, 2010, Proceedings of the CSEE, V30, P50
[8]
Lei Jian-Sheng, 2001, Proceedings of the CSEE, V21, P57
[9]
Li Xiao-ming, 2004, Proceedings of the CSEE, V24, P49
[10]
Liu J., 2002, SIMPLIFIED ANAL OPTI