.png){kind=icon}
返回
Robust ranking and selection with optimal computing budget allocation
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2017.03.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the ranking and selection (R&S) problem with input uncertainty. It seeks to maximize the probability of correct selection (PCS) for the best design under a fixed simulation budget, where each design is measured by their worst-case performance. To simplify the complexity of PCS, we develop an approximated probability measure and derive an asymptotically optimal solution of the resulting problem. An efficient selection procedure is then designed within the optimal computing budget allocation (OCBA) framework. More importantly, we provide some useful insights on characterizing an efficient robust selection rule and how it can be achieved by adjusting the simulation budgets allocated to each scenario. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Simulation optimization
Ranking and selection
OCBA
Robust optimization
Computing budget allocation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
查看更多内容