A Multi-Objective Giant Trevally Optimizer with Feasibility-Aware Archiving for Constrained Optimization

Multi-objective optimization (MOO) plays a critical role in mechanical and industrial engineering, where conflicting design goals must be balanced under complex constraints. In this study, we introduce the Multi-Objective Giant Trevally Optimizer (MOGTO), a novel extension of the Giant Trevally Optimizer inspired by predatory foraging dynamics. MOGTO integrates predation-regime switching into a Pareto-based framework, enhanced with feasibility-aware archiving, knee-biased selection, and adaptive constraint handling. We benchmark MOGTO against established algorithms—NSGA-II, SPEA2, MOEA/D, and ParetoSearch—using synthetic test suites (ZDT1–3, DTLZ2) and classical engineering problems (welded beam, spring, and pressure vessel). Performance was assessed with Hypervolume (HV), Inverted Generational Distance (IGD), Spacing, and coverage metrics across 30 independent runs. The results demonstrate that MOGTO consistently achieves competitive or superior HV and IGD, maintains more uniform spacing, and generates larger feasible archives than the baselines. Particularly on constrained engineering problems, MOGTO yields more feasible non-dominated solutions, confirming its robustness and industrial applicability. These findings establish MOGTO as a reliable and general-purpose metaheuristic for multi-objective optimization in engineering design.