An adaptive switching-based evolutionary algorithm for many-objective optimization

摘要

Pareto-based evolutionary algorithms are challenging in dealing with many-objective problems encountering many incomparable nondominated solutions. To reduce selection pressure and improve diversity, this paper proposes an adaptive switching strategy-based evolutionary algorithm for many-objective optimization. This strategy contains two deletion criteria, which are switched adaptively between generations, aiming to delete poor solutions one by one in environmental selection. The first criterion is devised to delete the solution with poor convergence among the two most similar solutions. The second criterion is developed to delete the worse solution according to a designed indicator that takes into account both convergence and diversity. Finally, comparisons with five state-of-the-art many-objective evolutionary algorithms on some widely used benchmark problems and the water resource planning problem are given to illustrate the effectiveness and advantages of the proposed algorithm.