Optimal computing budget allocation for ranking the top designs with stochastic constraints

Author(s):  
Hui Xiao ◽  
Hu Chen ◽  
Loo Hay Lee
Automatica ◽  
2017 ◽  
Vol 81 ◽  
pp. 30-36 ◽  
Author(s):  
Siyang Gao ◽  
Hui Xiao ◽  
Enlu Zhou ◽  
Weiwei Chen

Author(s):  
Tianxiang Wang ◽  
Jie Xu ◽  
Jian-Qiang Hu

We consider how to allocate simulation budget to estimate the risk measure of a system in a two-stage simulation optimization problem. In this problem, the first stage simulation generates scenarios that serve as inputs to the second stage simulation. For each sampled first stage scenario, the second stage procedure solves a simulation optimization problem by evaluating a number of decisions and selecting the optimal decision for the scenario. It also provides the estimated performance of the system over all sampled first stage scenarios to estimate the system’s reliability or risk measure, which is defined as the probability of the system’s performance exceeding a given threshold under various scenarios. Usually, such a two-stage procedure is very computationally expensive. To address this challenge, we propose a simulation budget allocation procedure to improve the computational efficiency for two-stage simulation optimization. After generating first stage scenarios, a sequential allocation procedure selects the scenario to simulate, followed by an optimal computing budget allocation scheme that determines the decision to simulate in the second stage simulation. Numerical experiments show that the proposed procedure significantly improves the efficiency of the two-stage simulation optimization for estimating system’s reliability.


2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Hui Xiao ◽  
Loo Hay Lee

We consider the problem of ranking the topmdesigns out ofkalternatives. Using the optimal computing budget allocation framework, we formulate this problem as that of maximizing the probability of correctly ranking the topmdesigns subject to the constraint of a fixed limited simulation budget. We derive the convergence rate of the false ranking probability based on the large deviation theory. The asymptotically optimal allocation rule is obtained by maximizing this convergence rate function. To implement the simulation budget allocation rule, we suggest a heuristic sequential algorithm. Numerical experiments are conducted to compare the effectiveness of the proposed simulation budget allocation rule. The numerical results indicate that the proposed asymptotically optimal allocation rule performs the best comparing with other allocation rules.


Sign in / Sign up

Export Citation Format

Share Document