Enhancement of Active Distribution Network Performance with Multiple Distributed Generators and DSTATCOMs using Reptile Search Algorithm

The integration of multiple DGs can introduce power quality issues and instability in the (DN) due to their intermittent and fluctuating nature. Distributed Static Compensators (DSTATCOMs) are devices that effectively manage and regulate both active and reactive powers, thereby maintaining the desired levels of reactive power in the DNs. This paper investigates the problem of determining the optimal number and placement of multiple DSTATCOMs within active DNs with multiple Distributed Generators (DGs) connected to them. To achieve the optimal sizing and allocation of multiple DSTATCOMs, a novel heuristic method called the reptile search algorithm (RSA) is introduced in this study. A combination of the RSA method and the loss sensitivity factor (LSF) are utilized to identify the optimal number, sizes, and locations of DSTATCOMs to enhance the performance of active DNs with different types of DGs and loads. The desired improvements include mitigating voltage deviation at nodes, minimizing system power losses, and alleviating overloading in feeders. The effectiveness of the algorithm is evaluated using an IEEE-33 bus DN, which is modified to incorporate different DGs and load types. To assess the efficiency of the proposed method, a modified particle swarm optimization (MPSO) algorithm is used for comparison. The results demonstrate that the RSA approach presented in this paper is robust in obtaining optimal solutions, offers fast and easy implementation, can be applied to large DNs, and outperforms the MPSO algorithm.