PUB - Publikationen an der Universität Bielefeld

A number of real-world multiobjective optimization problems (MOPs) are driven by the data from experiments or computational simulations. In some cases, no new data can be sampled during the optimization process and only a certain amount of data can be sampled before optimization starts. Such problems are known as offline data-driven MOPs. Although multiple surrogate models approximating each objective function are able to replace the real fitness evaluations in evolutionary algorithms (EAs), their approximation errors are easily accumulated and therefore, mislead the solution ranking. To mitigate this issue, a new surrogate-assisted indicator-based EA for solving offline data-driven multiobjective problems is proposed. The proposed algorithm adopts an indicator-based selection EA as the baseline optimizer due to its selection robustness to the approximation errors of surrogate models. Both the Kriging models and radial basis function networks (RBFNs) are employed as surrogate models. An adaptive model selection mechanism is designed to choose the right type of models according to a maximum acceptable approximation error that is less likely to mislead the indicator-based search. The main idea is that when the uncertainty of the Kriging models exceeds the acceptable error, the proposed algorithm selects RBFNs as the surrogate models. The results comparing with state-of-the-art algorithms on benchmark problems with up to ten objectives indicate that the proposed algorithm is effective on offline data-driven optimization problems with up to 20 and 30 decision variables.