Solving Reactive Power Scheduling Problem using Multi-objective Crow Search Algorithm

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper presents the solution of multi-objective based optimal reactive power dispatch (MO-ORPD) problem by optimizing the system power losses and voltage stability enhancement index (VSEI)/L-index objectives. ORPD problem is considered as an important issue from system security and operational point of view for optimal steady-state operation of power system. Here, single-objective based ORPD problem is solved using Crow Search Algorithm (CSA) and multi-objective based ORPD problem is solved using multi-objective CSA (MO-CSA). The CSA is considered as an efficient and robust algorithm which determines the global optimal solution for solving the non-linear and discontinuous objective functions. Two standard test systems, i.e., IEEE 30 and 57 bus systems are considered to show the effectiveness, suitability and robustness of CSA and MO-CSA for solving the ORPD problem.

Cite

CITATION STYLE

APA

Salkuti, S. R. (2021). Solving Reactive Power Scheduling Problem using Multi-objective Crow Search Algorithm. International Journal of Advanced Computer Science and Applications, 12(6), 42–48. https://doi.org/10.14569/IJACSA.2021.0120606

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free