.png){kind=icon}
返回
Efficient subset selection for the expected opportunity cost
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2015.06.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A lot of problems in automatic control aim at seeking top designs for discrete-event systems. In many cases, these problems are most suitable to be modeled as simulation optimization problems, and a key question for solving these problems is how to efficiently and accurately select the top designs given a limited simulation budget. This paper considers the generalized problem of selecting the top m designs from a finite set of design alternatives based on simulated outputs, subject to a constraint on the total number of samples available. The quality of the selection is measured by the expected opportunity cost, which penalizes particularly bad choices more than the slightly incorrect selections and is preferred by risk-neutral practitioners and decision makers. An efficient simulation budget allocation procedure, called EOC-m, is developed for this problem. The efficiency of the proposed method is illustrated through numerical testing. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Simulation optimization
Budget allocation
OCBA
Opportunity cost
Subset selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容