Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions

Abstract

Probabilistic robustness evaluation is a promising approach to evolutionary robust optimization; however, high computational time arises. In this paper, we apply this approach to the Bayesian optimization algorithm (BOA) with a view to improving its computational time. To this end, we analyze the Bayesian networks constructed in BOA in order to extract the patterns of non-robust solutions. In each generation, the solutions that match the extracted patterns are detected and then discarded from the process of evaluation; therefore, the computational time in discovering the robust solutions decreases. The experimental results demonstrate that our proposed method reduces computational time, while increasing the robustness of solutions. (C) 2017 Published by Elsevier B.V.