.png){kind=icon}
返回
Balancing Search and Estimation in Random Search Based Stochastic Simulation Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2016.2522094.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Stochastic simulation optimization involves two fundamental steps: 1) searching the solution space to generate candidate solutions for comparison and 2) estimating the performance of each candidate solution via multiple simulations and selecting a solution as the best solution found. Comparisons of solutions via simulation estimation are subject to error due to the stochastic noise in simulation output. While estimation errors can be reduced by increasing the number of simulation replications, it would in turn limit the number of candidate solutions that can be generated for comparison in a fixed computation budget. Under a random search framework, we derive an analytical formula to (approximately) optimally determine the number of candidate solutions generated in the search step and simulation replications in the estimation step to maximize the quality of the solution selected as the best by the random search algorithm. We then propose a practical method based on this formula and test the method on several common benchmark problems. Experiment results show that our method is quite effective and leads to significant improvement in the quality of the best solution found.
Keyword:
Optimal number of replications
optimal sampling set size
simulation optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容