Solution of optimal power flow problem using sine-cosine mutation based modified Jaya algorithm: a case study

For planning the economic operation and control of an existing electricity grid and its future extension planning, the optimal power flow (OPF) results are essential. In this paper, a hybrid algorithm is proposed, which is based on a sine-cosine mutation operator and a modified Jaya (SCM-MJ) algorithm to solve the OPF problems. The efficacy of the SCM-MJ algorithm is primarily evaluated using thirteen (unimodal and multimodal) mathematical benchmark functions. Later, the SCM-MJ algorithm is applied on the Algerian 59-bus system and IEEE 118-bus test system to handle the OPF problems. The SCM-MJ has successfully achieved a minimum value of an objective function over several runs than other modern meta-heuristic optimization approaches in all the thirteen mathematical benchmark functions as well as in OPF case studies. For example, in the Algerian 59-bus system, the quadratic fuel cost obtained by SCM-MJ is 1688 $/hour, with a saving of 13.12% of the initial fuel cost. This benefit increases further with the size of the system. The SCM-MJ algorithm has provided high-quality solutions for mathematical benchmark functions and OPF problems quickly and efficiently. The comparison of numerical outcomes demonstrates that the suggested SCM-MJ algorithm dominates over other approaches for solving the OPF problem.