“…The representative methods of this approach have the rank-based fitness assignment method of genetic algorithms, [15] the niched Pareto genetic algorithm (NPGA), [16] the non-dominated ranking genetic algorithm (NSGA) [17] and its classical improved version NSGA-II, [18] the micro-genetic algorithm, [19] the Pareto archive evolution strategy (PAES), [20] the strength Pareto evolutionary algorithm (SPEA) [21] and its improved version SPEA2, [22] the incremental multi-objective evolutionary algorithm (MOEA), [23] and the MOEA based on decomposition techniques. [24][25] In addition to the traditional EAs, other evolutionary metaheuristics have also been proposed and used to successfully solve the MOPs, such as Scatter Search (SS), [26][27] Particle Swarm Optimization (PSO), [28][29][30] Differential Evolution (DE), [31][32][33] and others. By combining different ideas or meta-heuristics, the proposed algorithm may further improve the effectiveness of methods in order to overcome the inherent limitations of a single evolutionary algorithm or meta-heuristic.…”