.png){kind=icon}
Return
Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2017.03.042.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Robust optimization
Bayesian optimization algorithm
Bayesian networks
Probabilistic robustness evaluation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
ShareSaveEnvironment identification-based memory scheme for estimation of distribution algorithms in dynamic environments.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveWaste recycling of cathode ray tube glass through industrial production of transparent ceramic frits
OAAI
OAAIShareSaveShareSaveShareSaveInstrumental aspects of secondary ion mass spectrometry and secondary ion imaging mass spectrometryVacuum
VacuumIF0
PREAI
ShareSaveShareSave
View more