Open AccessOptimizing location and size of distributed generators based on the metaheuristic algorithms for solving network reconfiguration problem
Author(s) -
Luu Quoc Cuong,
A M Maclesov,
Ha-Nam Nguyen,
Ilgiz Valeev
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/643/1/012054
Subject(s) - control reconfiguration , computer science , algorithm , power (physics) , process (computing) , metaheuristic , mathematical optimization , mode (computer interface) , distributed computing , mathematics , embedded system , physics , quantum mechanics , operating system
This paper demonstrates the method of optimizing the location and size of the distributed generators with the aim of reducing active power loss by changing the state of the existing tie and sectionalizing switches on the distribution network. A new algorithm is proposed to solve the distribution network reconfiguration problem based on the Runner-root Algorithm (RRA). In the first stage, the Runner-root algorithm is applied to solve the reconfiguration problem, and the next stage of optimizing the new distribution network configuration takes into account the influence of the location and the size of the distributed generators. The calculation results show that the proposed method can simultaneously solve the problem of optimizing the location and size of distributed generators when reconfiguring the distribution network. The results of the comparison with other studies in the same distribution network system 69 nodes showed that the proposed method is highly effective and can be used for reference in the process of optimizing the operating mode of a distribution network.