I. Introduction
Multi-objective optimization problems (MOPs) inherently involve multiple conflicting objectives, making it challenging to find a solution that optimizes all of them simultaneously [1], [2]. Among various types of optimizers, multi-objective evolutionary algorithms (MOEAs) have proven advantageous in addressing MOPs. These algorithms initialize a population, iteratively generate new solutions through variation operators, and employ environmental selection strategies to eliminate inferior solutions, resulting in well-converged and diversified solutions forming a Pareto set in the decision space and a Pareto front in the objective space [3], [4].