Corner Based Many-Objective Optimization


The performance of multi-objective evolutionary algorithms (MOEA) is severely deteriorated when applied to many-objective problems. For Pareto dominance based techniques, available information about optimal solutions can be used to improve their performance. This is the case of corner solutions. This work considers the behaviour of three multi-objective algorithms (NSGA-II, SMPSO and GDE3) when corner solutions are inserted into the population at different evolutionary stages. Corner solutions are found using specific algorithms. Preliminary results are presented concerning the behaviour of the aforementioned algorithms in five benchmark problems (DTLZ1-5).