Please use this identifier to cite or link to this item:
Title: An investigation on noise-induced features in robust evolutionary multi-objective optimization
Authors: Goh, C.K.
Tan, K.C. 
Cheong, C.Y.
Ong, Y.S.
Keywords: Evolutionary algorithms
Multi-objective optimization
Robust solutions
Robust test functions
Issue Date: Aug-2010
Citation: Goh, C.K., Tan, K.C., Cheong, C.Y., Ong, Y.S. (2010-08). An investigation on noise-induced features in robust evolutionary multi-objective optimization. Expert Systems with Applications 37 (8) : 5960-5980. ScholarBank@NUS Repository.
Abstract: Multi-objective (MO) optimization is a challenging research topic because it involves the simultaneous optimization of several complex and conflicting objectives that requires researchers to address many issues which are unique to MO problems. However multi-objectivity is only one aspect of real-world applications and there is a growing interest in the optimization of solutions that are insensitive to parametric variations as well. In order to evaluate the capability of MO evolutionary algorithms (MOEAs) to find robust solutions, it is important to employ suitable test functions. In this paper, empirical studies are conducted to examine the suitability of existing robust test functions. Results suggest that these test functions have a bias towards the region where the robust solutions lie, rendering it difficult to assess the true capability of MOEAs. Motivated by such a finding, we present a framework for the construction of robust continuous MO test functions characterized by different noise-induced features. These noise-induced features can pose different difficulties to the optimization algorithms. A fitness-inheritance scheme is also presented and incorporated into two well-known MOEAs. Empirical analysis of the proposed robust MO test functions reveals that some noise-induced features present greater challenges to robust MOEAs as compared to existing robust test functions. In addition, the vehicle routing problem with stochastic demand (VRPSD) is presented as a practical example of robust combinatorial MO optimization problems. The work presented in this paper should encourage further studies and the development of more effective algorithms for robust MO optimization. © 2010 Elsevier Ltd. All rights reserved.
Source Title: Expert Systems with Applications
ISSN: 09574174
DOI: 10.1016/j.eswa.2010.02.008
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Oct 18, 2018


checked on Oct 2, 2018

Page view(s)

checked on Oct 13, 2018

Google ScholarTM



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