A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

•Any numbers of weight vectors with good diversity can be generated by a uniform design method.•A sub-population strategy is used to enhance the local search ability of the algorithm.•An update strategy based on decomposition is proposed to maintain the diversity.

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.

Graphical abstractFigure optionsDownload full-size imageDownload as PowerPoint slide