manyobjective
Manyobjective optimization, often abbreviated as MaOP or manyobjective, refers to optimization problems that involve four or more conflicting objectives. It extends the more common multiobjective optimization framework by focusing on high-dimensional objective spaces, where uncovering and maintaining a diverse set of trade-off solutions becomes increasingly difficult. The goal is typically to approximate the Pareto front, representing non-dominated solutions with respect to all objectives, suitable for decision makers.
Key challenges in manyobjective optimization include the diminishing impact of dominance relations as the number of
Common approaches employ evolutionary, decomposition-based, or indicator-based methods adapted for many objectives. Notable examples include NSGA-II
Evaluation of MaOP solvers often relies on hypervolume, inverted generational distance, and epsilon-indicator metrics, though hypervolume