A novel merchant optimization algorithm for solving optimal reactive power problem

In this paper Merchant Optimization Algorithm (MOA) is proposed to solve the optimal reactive power problem. Projected algorithm is modeled based on the behavior of merchants who gain in the market through various mode and operations. Grouping of the traders will be done based on their specific properties, and by number of candidate solution will be computed to individual merchant. First Group named as “Ruler candidate solution” afterwards its variable values are dispersed to the one more candidate solution and it named as “Serf candidate solution” In standard IEEE 14, 30, 57 bus test systems Merchant Optimization Algorithm (MOA) have been evaluated. Results show the proposed algorithm reduced power loss effectively.

---

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2021).