“…A multiobjective optimization problem (MOP) is a kind of challenging and complex optimization problem. Because the optimization goals conflict with each other, it is extremely difficult to obtain a single global optimal solution, so it is a set of compromise Pareto optimal solutions [24,25]. In recent decades, many similar optimization algorithms have appeared, such as PEAS [26], SPEA2 [27], NSGAII [28], MOEA [29], MOEA/D [30], IBEA [31], and HypE [32].…”