Logo
Logo
Campo de búsqueda / búsqueda general

 
Autor
Título
Tema

Título: MOEA/D assisted by RBF networks for expensive multi-objective optimization problems
Autor(es): ZAPOTECAS MARTINEZ, SAUL
COELLO COELLO, CARLOS ARTEMIO
Temas: Optimización combinatoria - Procesamiento de datos
Algoritmos computacionales
Inteligencia computacional
Fecha: 2013
Editorial: Nueva York : Association for Computing Machinery
Citation: Proceedings of the Genetic and Evolutionary Computation Conference July 2013
Resumen: The development of multi-objective evolutionary algorithms assisted by surrogate models has increased in the last few years. However, in real-world applications, the high modality and dimensionality that functions have, often causes problems to such models. In fact, if the Pareto optimal set of a multi-objective optimization problem is located in a search space in which the surrogate model is not able to shape the corresponding region, the search could be misinformed and thus converge to wrong regions. Because of this, a considerable amount of research has focused on improving the prediction of the surrogate models by adding the new solutions to the training set and retraining the model. However, when the size of the training set increases, the training complexity can significantly increase. In this paper, we present a surrogate model which maintains the size of the training set, and in which the prediction of the function is improved by using radial basis function networks in a cooperative way. Preliminary results indicate that our proposed approach can produce good quality results when it is restricted to performing only 200, 1,000 and 5,000 fitness function evaluations. Our proposed approach is validated using a set of standard test problems and an airfoil design problem.
URI: http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/477
Aparece en las colecciones:Libros

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
MOEA.pdf541.89 kBAdobe PDFVisualizar/Abrir


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