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

Abstract

Load variations in any power system result in losses 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 the priorly existing methods that ideally allocation of DGs has been carried out during fixed loads and constant power requirements. However, in real scenarios the loads are always variable and allocation of DGs must be done in accordance to the variations of the connected load. Therefore, the current paper addressed the aforementioned problem by distinctive optimal allocation of DGs for each variability of 24hour load horizon. However, the single exclusive solution is considered among all allocations of 24 hours. The min-max regret concept has been utilized in order to deal with such 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 royal 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 of active and reactive power losses and voltage deviation. Hence, in order to find robustness of proposed technique, Conseil international des grands réseaux electriques (CIGRE’s) MV benchmark model incorporating 14 buses has been considerably used as a test network. In the end the results of three proposed algorithms have been compared.