Optimal Reactive Power Dispatch Using Moth-Flame Optimization Algorithm

摘要

This paper describes a newly developed Moth-Flame optimization algorithm to deal with optimal reactive power dispatch problem. The prime intention of reactive power dispatch problem is to curtail the real power loss and control the bus voltages in power system network. The Moth-Flame algorithm is one of the most powerful and robust new global optimization algorithms in engineering. The primary aim of this advanced algorithm is quick convergence rate owing to the roulette wheel election method. This algorithm deals with numerous nonconvex, non-linear, continuous & discrete variable reactive power optimization problems. The Moth-Flame optimization is established by flow of moths in the direction from source to flame. This optimization algorithm employs a standard IEEE-30 bus & 57 bus system to attain the optimal settings of regulating variables from reactive power compensating components. As a result of the regulating variables, the prime intentions for system network can be achieved. The outcome solutions and results are notable in comparison with other well-known algorithms reported in journals.