An improved Manta ray foraging optimizer for cost-effective emission dispatch problems
Robustness
Economic Dispatch
Local optimum
Pareto optimal
DOI:
10.1016/j.engappai.2021.104155
Publication Date:
2021-01-20T02:25:00Z
AUTHORS (4)
ABSTRACT
Abstract Recently, Manta ray foraging optimization (MRFO) has been developed and applied for solving few engineering optimization problems. In this paper, an elegant approach based on MRFO integrated with Gradient-Based Optimizer (GBO), named MRFO–GBO, is proposed to efficiently solve the economic emission dispatch (EED) problems. The proposed MRFO–GBO aims to reduce the probability of original MRFO to get trapped into local optima as well as accelerate the solution process. The goal of solving optimal Economic Emission Dispatch (EED) is to economically provide all required electrical loads as well as minimizing the emission with satisfying the operating equality and inequality constraints. Single and multi-objective EED problems are solved using the proposed MRFO–GBO and classical MRFO. In multi-objective EED, fuzzy set theory is adapted to determine the best compromise solution among Pareto optimal solutions. The proposed algorithm is firstly validated through well-known CEC’17 test functions, and then applied for solving several scenarios of EED problems for three electrical systems with 3-generators, 5-generators, and 6-generators. The validation is achieved through different load levels of the tested systems to prove the robustness of the proposed algorithm. The results obtained by the proposed MRFO–GBO are compared with those obtained by recently published optimization techniques as well as the original MRFO and GBO. The results illustrate the ability of the proposed MRFO–GBO in effectively solving the single and multi-objective EED problems in terms of precision, robustness, and convergence characteristics.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (58)
CITATIONS (97)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....