Decision space decomposition for multiobjective optimization

Being inspired by the parametric decomposition theorem for multiobjective optimization problems (MOPs) of Cuenca Mira and Miguel García (2017), and by the block-coordinate descent for single objective optimization problems, we present a decomposition theorem for computing the set of minimal elements of a partially ordered set. This set is decomposed into subsets whose minimal elements … Read more

Comparison Between NSGA-II and MOEA/D on a Set of Multiobjective Optimization Problems with Complicated Pareto Sets

Partly due to lack of test problems, the impact of the Pareto set (PS) shapes on the performance of evolutionary algorithms has not yet attracted much attention. This paper introduces a general class of continuous multiobjective optimization test instances with arbitrary prescribed PS shapes, which could be used for studying the ability of MOEAs for … Read more