Min-Max Regret-Based Approach for Sizing and Placement of DGs in Distribution System under a 24 h Load Horizon

Load variations in any power system result in loss escalation and voltage drops. With the sensible and optimal allocation of distributed generators (DGs), these problems could be considerably mitigated. It has been seen in existing methods that, ideally, the allocation of DGs has been carried out during fixed loads and constant power requirements. However, in real scenarios the loads are always variable and the allocation of DGs must be done in accordance with the variations of the connected load. Therefore, the current paper addresses the aforementioned problem by the distinctive optimal allocation of DGs for each variability of 24 h load horizon. However, a single exclusive solution is considered among all allocations of 24 h. The min-max regret concept has been utilized in order to deal with such a methodology. Altogether, 24 scenarios are analyzed wherein each scenario corresponds to a specific hour of the respective day. The optimal allocation of DGs in terms of their optimal sizing and placement has been carried out by using three algorithms including battle royale optimization (BRO), accelerated particle swarm optimization (APSO), and genetic algorithm (GA). The multi-objective optimization problem is evaluated on the basis of minimum value criterion of the multi-objective index (MO). MO comprises active and reactive power losses and voltage deviation. Hence, in order to find the robustness of the proposed technique, Conseil international des grands reseaux electriques’ (CIGRE) MV benchmark model incorporating 14 buses has been used considerably as a test network. In the end, the results of three proposed algorithms have been compared.