Comparison of MOEA/D Variants on Benchmark Problems

Abstract

Given that the definition of the multi-objective optimization problem is raised when number of objectives is increased in number at the optimization problem, where not only the number of objectives but also the computational resources which are needed to solve the problem, is also more desired. Therefore, novel approaches had required to solve multi-objective optimization problem in a reasonable time. One of this novel approach is utilization of the decomposition method with the evolutionary algorithm/operator. This algorithm was called multi-objective evolutionary algorithm based on decomposition (MOEA/D). Later on, variants have been proposed to improve the performance of the MOEA/D algorithm. However, a general comparison between these variants has needed for demonstrate the performance of these algorithm. For this reason, in this research the variants of MOEA/D algorithms have implemented on benchmark problems (DTLZ and MaF) and the performances has compared with each other. Two metrics had selected to evaluate/compare the performances of the variants. The metrics are IGD and Spread metrics. The results at the end of the implementations suggest that adaptive weighting idea is the most promising idea to increase the performance of the MOEA/D algorithm.