Dynamic reconfiguration of a distribution network based on an improved grey wolf optimization algorithm

被引:0
|
作者
Tian S. [1 ]
Liu L. [1 ]
Wei S. [1 ]
Fu Y. [1 ]
Mi Y. [1 ]
Liu S. [2 ]
机构
[1] College of Electrical Engineering, Shanghai University of Electric Power, Shanghai
[2] State Grid Shanghai Electric Power Research Institute, Shanghai
关键词
Distributed generation; Distribution network dynamic reconfiguration; Improved grey wolf optimization algorithm; K-means++clustering;
D O I
10.19783/j.cnki.pspc.201356
中图分类号
学科分类号
摘要
To improve distribution network reconfiguration with Distributed Generation (DG), a dynamic distribution network reconfiguration model considering time-varying characteristics of DG output and load demand is established. First, the K-means++ clustering algorithm is used to divide the daily load period. Then, the system loss and voltage deviation are taken as the objective functions, and the improved grey wolf optimization algorithm is used to optimize the calculation. To tackle uneven initial population distribution, lack of global communication and 'easy to fall into local optima' in traditional grey wolf optimization algorithms, when generating the initial population, it introduces tent mapping to enhance the uniformity of the initial population. A cooperative competition mechanism is introduced to improve the utilization rate of effective information between individuals. An adaptive inertia weight is introduced when the grey wolf population position is updated to meet the optimization requirements of different periods. Finally, the feasibility and superiority of the proposed algorithm are verified by a numerical example. © 2021 Power System Protection and Control Press.
引用
收藏
页码:1 / 11
页数:10
相关论文
共 24 条
  • [1] TIAN Hao, LU Lin, GAO Hongjun, Et al., Dynamic reconfiguration of distribution network considering power grid operation characteristic, Power System Protection and Control, 43, 1, pp. 9-14, (2015)
  • [2] FAN Jiyuan, ZHANG Lan, MCDONALD J D., Distribution network reconfiguration: single loop optimization, IEEE Transactions on Power Systems, 11, 3, pp. 1643-1647, (1996)
  • [3] LIU Baisi, XIE Kaigui, ZHOU Jiaqi, Dynamic programming algorithm for distribution network reconstruction, Proceedings of the CSEE, 25, 9, pp. 29-34, (2005)
  • [4] HUANG Wei, JI Shuangquan, A method for fast loss reduction and reconstruction of distribution network based on feeder couple, Automation of Electric Power Systems, 39, 5, pp. 75-80, (2015)
  • [5] ZHANG Zhongshi, WANG Gaomeng, ZHANG Tanyong, Et al., A new method for one-stage distribution system reconfiguration based on optimal flow algorithm and Mayeda spanning tree algorithm, Electric Power, 51, 9, pp. 110-117, (2018)
  • [6] ABDELAZIZ M., Distribution network reconfiguration using a genetic algorithm with varying population size, Electric Power Systems Research, 142, pp. 9-11, (2017)
  • [7] XU Yuan, Application of improved particle swarm optimization algorithm in the optimization and reconstruction of distribution network with distributed power, Electrical Measurement & Instrumentation, 58, 3, pp. 98-104, (2021)
  • [8] YANG Xiaoming, LU Hongfang, ZHU Hui, Reconfiguration of distribution network based on improved artificial fish swarm algorithm, Electrical Measurement & Instrumentation, 57, 17, pp. 72-78, (2020)
  • [9] LI Meng, WANG Lili, LIU Xiangshi, Et al., Multi-objective active reconfiguration of distribution network based on the "properly matched marriage" genetic algorithm, Power System Protection and Control, 47, 7, pp. 30-38, (2019)
  • [10] JASTHI K, DAS D., Simultaneous distribution system reconfiguration and DG sizing algorithm without load flow solution, IET Generation, Transmission & Distribution, 12, 6, pp. 1303-1313, (2018)