Please use this identifier to cite or link to this item:
Title: Many-objective optimization with corner-based search
Authors: Hélio Alves Freire
Paulo Moura Oliveira
Eduardo Pires
Maximino Bessa
Issue Date: 2015
Abstract: 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.
metadata.dc.type: article
Appears in Collections:CRIIS - Articles in International Journals
CSIG - Articles in International Journals

Files in This Item:
File Description SizeFormat 
  Restricted Access
843.8 kBAdobe PDFThumbnail
View/Open Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.