Optimal power flow using the AMTPG-Jaya algorithm

This work proposes the implementation of a recently invented meta-heuristic optimization solver namely, an adaptive multiple teams perturbation-guiding Jaya (AMTPG-Jaya) technique to tackle with diverse single goal optimum power flow (OPF) forms. The AMTPG-Jaya solver employs numerous populations named as teams to investigate the search domain. Each team is guided by a number of movement equations (exploration pathways). The algorithm adjusts the number of teams along with the approaching to the finest so-far nominee solution. In this study, an original AMTPG-Jaya inspired approach to handle the OPF formulation is suggested. The efficacy of the AMTPG-Jaya solver is scrutinized and tested on two well-known standard power systems with different goal functions. The optimization outcomes reveal that the AMTPG-Jaya is able to reach an optimal solution with brilliant convergence speed. In addition, a robustness examination is implemented to evaluate the reliability of the AMTPG-Jaya solver. The simulation results disclose the dominance and potential of the AMTPG-Jaya over many solvers recently stated in the previous publications with regard to solution quality and validity. (C) 2020 Elsevier B.V. All rights reserved.