MARATTO

article

An Enhanced Jaya Optimization Algorithm (EJOA) for Solving Multi-Objective ORPD Problem

Abstract

This article presents an enhanced Jaya optimization algorithm (EJOA) for solving a multi objective function (MOF) of the optimal reactive power dispatch (ORPD) problem. This solution aims to determine the optimal scheduling of control variables to achieve the ORPD primary objectives as well as respecting equality and inequality constrains. This problem is concerned with minimizing the real power losses (P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</sub> ) and voltage deviation (VD) in power systems. The ORPD problem can be formulated as a non-linear and complex framework. The MOF is dependent on a combination of weighted sum method and fuzzy logic to find the best compromise solution of the competitive objective functions (COFs). For proving the effectiveness of the proposed EJOA, two test systems, IEEE 30-bus system and the network of west delta as a real system (WDRN), are used to prove the capability of the proposed Jaya algorithm with weight sum method and fuzzy member ship for solving a multi-objective ORPD problem. The obtained results confirm that the proposed Jaya algorithm is an effective tool that can makes a noticeable enhancement on solving ORPD problem.

Research topics

  • Electric Power System Optimization
  • Optimal Power Flow Distribution
  • Microgrid Control and Optimization

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.1109/itce.2019.8646363

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.