title: A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy.
abstract: Most existing multiobjective evolutionary algorithms experience difficulties in solving many-objective optimization problems due to their incapability to balance convergence and diversity in the high-dimensional objective space. In this paper, we propose a novel many-objective evolutionary algorithm using a one-by-one selection strategy. The main idea is that in the environmental selection, offspring individuals are selected one by one based on a computationally efficient convergence indicator to increase the selection pressure toward the Pareto optimal front. In the one-by-one selection, once an individual is selected, its neighbors are de-emphasized using a niche technique to guarantee the diversity of the population, in which the similarity between individuals is evaluated by means of a distribution indicator. In addition, different methods for calculating the convergence indicator are examined and an angle-based similarity measure is adopted for effective evaluations of the distribution of solutions in the high-dimensional objective space. Moreover, corner solutions are utilized to enhance the spread of the solutions and to deal with scaled optimization problems. The proposed algorithm is empirically compared with eight state-of-the-art many-objective evolutionary algorithms on 80 instances of 16 benchmark problems. The comparative results demonstrate that the overall performance of the proposed algorithm is superior to the compared algorithms on the optimization problems studied in this paper.
authors.forename: Yiping
authors.initials: Y
authors.lastname: Liu
authors.forename: Dunwei
authors.initials: D
authors.lastname: Gong
authors.forename: Jing
authors.initials: J
authors.lastname: Sun
authors.forename: Yaochu
authors.initials: Y
authors.lastname: Jin