返回
Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions
DOI:10.1016/j.asoc.2017.03.042.png)
摘要
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.
Keyword:
Robust optimization
Bayesian optimization algorithm
Bayesian networks
Probabilistic robustness evaluation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Evolutionary robustness analysis for multi-objective optimization: benchmark problems多目标优化的进化鲁棒性分析: 基准问题
Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments
SOFT COMPUTING
IF2.5
Waste recycling of cathode ray tube glass through industrial production of transparent ceramic frits
Instrumental aspects of secondary ion mass spectrometry and secondary ion imaging mass spectrometry
Vacuum
IF0

