MOEA/HD: A Multiobjective Evolutionary Algorithm Based on Hierarchical Decomposition

Recently, numerous multiobjective evolutionary algorithms (MOEAs) have been proposed to solve the multiobjective optimization problems (MOPs). One of the most widely studied MOEAs is that based on decomposition (MOEA/D), which decomposes an MOP into a series of scalar optimization subproblems, via a set of uniformly distributed weight vectors. MOEA/D shows excellent performance on most mild MOPs, but may face difficulties on ill MOPs, with complex Pareto fronts, which are pointed, long tailed, disconnected, or degenerate. That is because the weight vectors used in decomposition are all preset and invariant. To overcome it, a new MOEA based on hierarchical decomposition (MOEA/HD) is proposed in this paper. In MOEA/HD, subproblems are layered into different hierarchies, and the search directions of lowerhierarchy subproblems are adaptively adjusted, according to the higher-hierarchy search results. In the experiments, MOEA/HD is compared with four state-of-the-art MOEAs, in terms of two widely used performance metrics. According to the empirical results, MOEA/HD shows promising performance on all the test problems.