New algorithms for DG allocation with less execution time to minimize the power loss

Abstract

Distributed Generation (DG) is necessary to reduce the power losses, improve the voltage profile and fulfil the load demand. DG location is the most important thing to achieve the minimum loss and also non optimum allocation of DG units can cause low or overvoltage in the system. The objective is to find those bus locations for which the loss is minimum and voltage is within the limits. Nowadays the use of methodology is very useful to the system planning engineer when dealing the increase of DG penetration as it is capable of analyzing the influence on some system characteristic of DG allocation. In this paper, two new algorithms are proposed with using backward forward load flow for the radial distribution system to find DG location for which the active power loss is minimum. By algorithm-I, better optimal locations for DGs on IEEE 33 bus test distribution system, has founded by searching every point and compared with grey wolf optimization's (GWO) results but algorithm-I consumed more time to search every possible location, it is difficult to use for large distribution bus system and for more number of DG. Then algorithm-II has proposed, it gives same results as algorithm-I even by consuming very less time. Also, allocate DGs on IEEE 69 radial distribution system using algorithm-I has been done.