A robust optimization approach for optimal power flow solutions using rao algorithms

Abstract

This paper offers three easy‐to‐use metaphor‐less optimization algorithms proposed by Rao to solve the optimal power flow (OPF) problem. Rao algorithms are parameter‐less optimization algorithms. As a result, algorithm‐specific parameter tuning is not required at all. This quality makes these algorithms simple to use and able to solve various kinds of complex constrained optimization and engineering problems. In this paper, the main aim to solve the OPF problem is to find the optimal values of the control variables in a given electrical network for fuel cost minimization, real power losses minimization, emission cost minimization, voltage profile improvement, and voltage stability enhancement, while all the operating constraints are satisfied. To demonstrate the efficacy of Rao algorithms, these algorithms have been employed in three standard IEEE test systems (30‐bus, 57‐bus, and 118‐bus) to solve the OPF problem. The OPF results of Rao algorithms and the results provided by other swarm intelligence (SI)/evolutionary computing (EC)‐based algorithms published in recent literature have been compared. Based on the outcomes, Rao algorithms are found to be robust and superior to their competitors.