IET Renewable Power Generation (Apr 2023)

Location and size selection using hybrid Jaya‐Luus‐Jaakola algorithm for decentralized generations in distribution system considering demand‐side management

  • V. P. Meena,
  • U. K. Yadav,
  • Akhilesh Mathur,
  • V. P. Singh,
  • Josep M. Guerrero,
  • Baseem Khan

DOI
https://doi.org/10.1049/rpg2.12692
Journal volume & issue
Vol. 17, no. 6
pp. 1535 – 1544

Abstract

Read online

Abstract In the distribution system, decentralized generation is incorporated to maximize the system reliability and economic stability, and to avoid redundancy in system. The efficient implementation of distributed‐generations (DGs) in a distribution‐system (DS) can be done by employing demand‐side management (DSM). In this research proposal, location and size selection of DGs in a DS considering DSM is accomplished using a hybrid Jaya‐Luus‐Jaakola (JLJ) algorithm. The hybridization of Jaya algorithm (JA) with Luus‐Jaakola algorithm (LJA) is done with a view to improving the rate of convergence of the algorithm. Three design objectives of minimization of active power loss and voltage deviation along with maximization of voltage stability index are considered in this research proposal. These design objectives under consideration are integrated together to form a problem of a single objective by assignments of weights. The formulated problem is minimized using proposed hybrid algorithm subjected to system constraints such as balance of power, limits on bus voltage and line capacity, and generation level of DGs. A static penalty is added to the formulated problem in case of any constraint violations. A photo‐voltaic‐based DG is used in the 33‐bus standard radial‐distribution‐system (RDS). A DSM scenario is created by shifting some loads of peak hours to off‐peak hours in view of minimizing the total cost of generation. The potency and superiority of the proposed algorithm is validated with the help of comparison of the results obtained by exploiting proposed method with results acquired from available state‐of‐art algorithms in literature. The comparison proves the comparative superior performance of the proposed algorithm.

Keywords