Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/227213
Title: SURROGATE-ASSISTED ALGORITHMS FOR COMPUTATIONALLY EXPENSIVE MULTI- AND MANY-OBJECTIVE GLOBAL OPTIMIZATION PROBLEMS
Authors: WANG WENYU
Keywords: Multi-Objective Optimization, Radial Basis Function, Expensive Objectives, Multi-Fidelity Optimization, Surrogate Modelling, Global Optimization
Issue Date: 28-Feb-2022
Citation: WANG WENYU (2022-02-28). SURROGATE-ASSISTED ALGORITHMS FOR COMPUTATIONALLY EXPENSIVE MULTI- AND MANY-OBJECTIVE GLOBAL OPTIMIZATION PROBLEMS. ScholarBank@NUS Repository.
Abstract: Multi-objective optimization problems often arise in real-world engineering applications, and they become more challenging when the evaluation of objective functions consumes a lot of resources. Assuming that each objective function is computationally expensive and black-box, this thesis contributes to the development of surrogate-assisted algorithms for two important variants of multi-objective optimization problems, namely 1) many-objective optimization problems where more than three objectives are considered and 2) multi-fidelity optimization problems where each objective has a computationally cheaper but less accurate representation. Different ways of modelling radial basis functions as surrogate models and using them to determine new sample points for expensive evaluation have been studied in this thesis. The newly proposed algorithms are comprehensively compared with recent state-of-the-art methods on a suite of multi-objective test problems. This thesis also investigates the performance of each proposed algorithm in calibrating hydrological simulation models built for real-world watersheds.
URI: https://scholarbank.nus.edu.sg/handle/10635/227213
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
WangWY.pdf8.7 MBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


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