Answers are grounded in this paper and cite their sources.
There exist numerous many-objective real-world optimization problems in various application domains for which it is difficult or time-consuming to derive Pareto optimal solutions. In an evolutionary algorithm, variation operators such as recombination and mutation are extremely important to obtain an effective solution search. In this paper, we study a machine learning-enhanced recombination that incorporates an intelligent variable selection method. The method is based on the importance of variables with respect to the ranking of solutions in objective space that express convergence to the Pareto front. We verify the performance of the enhanced recombination on benchmark test problems with three or more objectives using the many-objective evolutionary algorithm ASH as a baseline algorithm.
No takes yet. Share an insight, caveat, or question.
Sagawa et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: