[TEVC14] A little modification of density estimation in classic Pareto-based algorithms to make them work very well for many-objective optimisation problems. [Read More]
[TEVC13, GECCO10] An evolutionary algorithm to explore the potential of the grid in solving many-objective problems. [Read More]
[AIJ15] Converting a given many-objective optimisation problem into a bi-goal optimisation problem regarding convergence and diversity, and then handling it using the Pareto dominance relation in this bi-goal domain.
[TEVC17] A vector angle-based many-objective evolutionary algorithm, which shares the similar idea as the decomposition-based method, but without the need of a set of weight vectors.