Optimal Planning of Power Distribution Network by a Novel Modified Jaya Algorithm in Multiobjective Perspective

Abstract

This article presents a novel improved Elitism oppositional Jaya algorithm for the optimal power distribution network reconfiguration and optimal sizing, siting of multiple distributed generations (DGs) with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P</i> , PQV buses. Here, PQV bus is a voltage-specified PQ type bus controlled by the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P</i> bus. In this proposed planning model, the basic Jaya algorithm is modified by incorporating variable inertia weight, vicinity searching capability, elitism property, and blended with an opposition learning-based strategy. This establishes an effective approach between global search and local search in quest of an optimal solution. A multiobjective framework is developed to optimize technical and economic objectives simultaneously. Optimal weights are allocated to each objective using an improved analytical hierarchy process method. Novel indices are proposed to identify the optimal locations of DGs also considering critical loads. During reconfiguration, the line data sequence is rearranged by a smart graph theory mechanism. Furthermore, different schemes have been studied by the suggested method on IEEE 33 and 69 bus distribution test systems. The findings of the study by using the proposed algorithm in comparison with particle swarm optimization (PSO) and enhanced leader PSO show its effectiveness and validity.