A new optimization technique for optimal reactive power scheduling using Jaya algorithm

Optimal reactive power scheduling is one of the most complex and challenging problems in modern power system operation. This has recently gained intense attention from the scientist and researchers all over the world due to the introduction of liberalization or deregulation of electricity industry where reactive power is being traded as an ancillary service. This paper proposes an improved algorithm for optimal reactive power scheduling (ORPS) problem and a recently introduced simple yet powerful optimization technique called Jaya Algorithm (JA) is utilized for the same. The main advantage of the Jaya Algorithm is that it does not require any problem dependent control parameters. The optimal reactive power scheduling (ORPS) problem is formulated considering minimization of both losses and system cost satisfying several equality and inequality constraints. The algorithm described in this work is implemented on a standard test system for verifying its effectiveness and randomness. A comparison study of the simulation results is also performed with other modern heuristic techniques. The simulation results prove that it can produce acceptable results.