Abstract:
Many-objective optimization deals with problems with more than three objectives. The rapid growth of non-dominated solutions with the increase of the number of objectives...Show MoreMetadata
Abstract:
Many-objective optimization deals with problems with more than three objectives. The rapid growth of non-dominated solutions with the increase of the number of objectives weakens the search ability of Pareto-dominance-based multiobjective evolutionary algorithms. MO-NSGA-II strengthens its dominance-based predecessor, NSGA-II, by guiding the search process with reference points. In this paper, we further improve MO-NSGA-II by enhancing its mating selection mechanism with a hierarchical selection and a neighborhood concept based on the reference points. Experimental results confirm that the proposed ideas lead to better solution quality.
Published in: 2014 IEEE Congress on Evolutionary Computation (CEC)
Date of Conference: 06-11 July 2014
Date Added to IEEE Xplore: 22 September 2014
ISBN Information: