Many-objective grasshopper optimization algorithm (MaOGOA): A new many-objective optimization technique for solving engineering design problems

Abstract

In metaheuristic multi-objective optimization, the term effectiveness is used to describe the performance of a metaheuristic algorithm in achieving two main goals-converging its solutions towards the Pareto front and ensuring these solutions are well-spread across the front. Achieving these objectives is particularly challenging in optimization problems with more than three objectives, known as many-objective optimization problems. Multi-objective algorithms often fall short in exerting adequate selection pressure towards the Pareto front in these scenarios and difficult to keep solutions evenly distributed, especially in cases with irregular Pareto fronts. In this study, the focus is on overcoming these challenges by developing an innovative and efficient a novel Many-Objective Grasshopper Optimisation Algorithm (MaOGOA). MaOGOA incorporates reference point, niche preserve and information feedback mechanism (IFM) for superior convergence and diversity. A comprehensive array of quality metrics is utilized to characterize the preferred attributes of Pareto Front approximations, focusing on convergence, uniformity and expansiveness diversity in terms of IGD, HV and RT metrics. It acknowledged that MaOGOA algorithm is efficient for many-objective optimization challenges. These findings confirm the approach effectiveness and competitive performance. The MaOGOA efficiency is thoroughly examined on WFG1-WFG9 benchmark problem with 5, 7 and 9 objectives and five real-world (RWMaOP1- RWMaOP5) problem, contrasting it with MaOSCA, MaOPSO, MOEA/DD, NSGA-III, KnEA, RvEA and GrEA algorithms. The findings demonstrate MaOGOA superior performance against these algorithms.