Please use this identifier to cite or link to this item:
|Title:||Efficient simulation budget allocation for selecting an optimal subset||Authors:||Chen, C.-H.
|Keywords:||Computing budget allocation
|Issue Date:||Sep-2008||Citation:||Chen, C.-H.,He, D.,Fu, M.,Lee, L.H. (2008-09). Efficient simulation budget allocation for selecting an optimal subset. INFORMS Journal on Computing 20 (4) : 579-595. ScholarBank@NUS Repository. https://doi.org/10.1287/ijoc.l080.0268||Abstract:||We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correctly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this correct selection probability, we derive an asymptotically optimal allocation and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocations are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedure has the potential to enhance computational efficiency for simulation optimization. © 2008 INFORMS.||Source Title:||INFORMS Journal on Computing||URI:||http://scholarbank.nus.edu.sg/handle/10635/63115||ISSN:||10919856||DOI:||10.1287/ijoc.l080.0268|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.