Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/102007
Title: Multi co-objective evolutionary optimization : cross surrogate augmentation for computationally expensive problems
Authors: Le, Minh Nghia
Ong, Yew Soon
Menzel, Stefan
Seah, Chun-Wei
Sendhoff, Bernhard
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2012
Source: Le, M. N., Ong, Y. S., Menzel, S., Seah, C.-W., & Sendhoff, B. (2012). Multi co-objective evolutionary optimization: Cross surrogate augmentation for computationally expensive problems. 2012 IEEE Congress on Evolutionary Computation (CEC).
Abstract: In this paper, we present a novel cross-surrogate assisted memetic algorithm (CSAMA) as a manifestation of multi co-objective evolutionary computation to enhance the search on computationally expensive problems by means of transferring, sharing and reusing information across objectives. In particular, the construction of surrogate for one objective is augmented with information from other related objectives to improve the prediction quality. The process is termed as a cross-surrogate modelling methodology, which will be used in lieu with the original expensive functions during the evolutionary search. Analyses on the prediction quality of the cross-surrogate modelling and the search performance of the proposed algorithm are conducted on the benchmark problems with assessments made against several state-of-the-art multiobjective evolutionary algorithms. The results obtained highlight the efficacy of the proposed CSAMA in attaining high quality Pareto optimal solutions under limited computational budget.
URI: https://hdl.handle.net/10356/102007
http://hdl.handle.net/10220/12022
DOI: 10.1109/CEC.2012.6252915
Rights: © 2012 IEEE.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Conference Papers

SCOPUSTM   
Citations 20

14
Updated on Jan 31, 2023

Page view(s) 20

660
Updated on Jan 31, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.