Affiliation:
1. Kohat University of Science & Technology (KUST), Pakistan
Abstract
Multiobjective evolutionary algorithm based on decomposition (MOEA/D) and an improved non-dominating sorting multiobjective genetic algorithm (NSGA-II) are two well known multiobjective evolutionary algorithms (MOEAs) in the field of evolutionary computation. This paper mainly reviews their hybrid versions and some other algorithms which are developed for solving multiobjective optimization problems (MOPs. The mathematical formulation of a MOP and some basic definitions for tackling MOPs, including Pareto optimality, Pareto optimal set (PS), Pareto front (PF) are provided in Section 1. Section 2 presents a brief introduction to hybrid MOEAs. The authors present literature review in subsections. Subsection 2.1 provides memetic multiobjective evolutionary algorithms. Subsection 2.2 presents the hybrid versions of well-known Pareto dominance based MOEAs. Subsection 2.4 summarizes some enhanced Versions of MOEA/D paradigm. Subsection 2.5 reviews some multimethod search approaches dealing optimization problems.
Reference133 articles.
1. Convergence Acceleration Operator for Multiobjective Optimization
2. Adra, S. F., Griffin, I., & Fleming, P. J. (2005). Hybrid multiobjective genetic algorithm with a new adaptive local search process. In Proceedings of the GECCO05, Washington, DC (pp. 1009–1010).
3. A hybrid scalarization and adaptive -ranking strategy for many-objective optimization;H.Aguirre;Parallel Problem Solving from Nature (PPSN XI),2011
4. Al Moubayed, N., Petrovski, A., & McCall, J. (2010). A novel smart multi-objective particle swarm optimisation using decomposi-tion. In Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part II (PPSN’10) (pp. 1–10). Berlin, Heidelberg, Germany: Springer-Verlag.
5. A study on synergy of multiple crossover operators in a hierarchical genetic algorithm applied to structural optimisation