Many-objective optimization with corner-based search

作者：Freire Hlio^*; de Moura Oliveira P B; Solteiro Pires E J; Bessa Maximino

来源：Memetic Computing, 2015, 7(2): 105-118.

DOI：10.1007/s12293-015-0151-4

• Many-objective algorithm
• Particle swarm optimization
• Corner solutions
• Evolutionary computation

The performance of multi-objective evolutionary algorithms can severely deteriorate when applied to problems with 4 or more objectives, called many-objective problems. For Pareto dominance based techniques, available information about some 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 [Non-dominated sorting genetic algorithm (NSGA-II), Speed-constrained multi-objective particle swarm optimization (SMPSO) and generalized differential evolution (GDE3)] when corner solutions are inserted into the population at different evolutionary stages. The problem of finding corner solutions is addressed by proposing a new algorithm based in multi-objective particle swarm optimization (MOPSO). Results concerning the behaviour of the aforementioned algorithms in five benchmark problems (DTLZ1-5) and respective analysis are presented.

• 出版日期2015-6