Abstract

This present study describes a novel manta ray foraging optimization approach based non-dominated sorting strategy, namely (NSMRFO), for solving the multi-objective optimization problems (MOPs). The proposed powerful optimizer can efficiently achieve good convergence and distribution in both the search and objective spaces. In the NSMRFO algorithm, the elitist non-dominated sorting mechanism is followed. Afterwards, a crowding distance with a non-dominated ranking method is integrated for the purpose of archiving the Pareto front and improving the optimal solutions coverage. To judge the NSMRFO performances, a bunch of test functions are carried out including classical unconstrained and constrained functions, a recent benchmark suite known as the completions on evolutionary computation 2020 (CEC2020) that contains twenty-four multimodal optimization problems (MMOPs), some engineering design problems, and also the modified real-world issue known as IEEE 30-bus optimal power flow involving the wind/solar/small-hydro power generations. Comparison findings with multimodal multi-objective evolutionary algorithms (MMMOEAs) and other existing multi-objective approaches with respect to performance indicators reveal the NSMRFO ability to balance between the coverage and convergence towards the true Pareto front (PF) and Pareto optimal sets (PSs). Thus, the competing algorithms fail in providing better solutions while the proposed NSMRFO optimizer is able to attain almost all the Pareto optimal solutions.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.