Abstract

The social mimic optimization algorithm (SMO) and its enhanced version (θ-SMO) is presented in the current study for the optimal dispatch problem of the reactive power (ORPD) with continuous and discrete control variables in the IEEE standard networks. The feasibleness and functioning of the θ-SMO and SMO algorithms are indicated for the IEEE 57-bus, and IEEE 118-bus standard networks. The outcomes of the simulation were compared, and it was shown that the optimization efficacy of these algorithms is higher than other rooted algorithms, such as optics in-spired optimization (OIO), the social spider algorithm (SSA) algorithm, and biogeography-based optimization (BBO). Results obtained for ORPD problem indicate better performance concerning the θ-SMO algorithm’s solution quality compared to original SMO algorithm and other algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call