Efficient Simulation Budget Allocation for Selecting an Optimal Subset
Authors:
- 1 November 2008
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 20 (4) , 579-595
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.Keywords
This publication has 22 references indexed in Scilit:
- Selecting a Selection ProcedureManagement Science, 2007
- A Model Reference Adaptive Search Method for Global OptimizationOperations Research, 2007
- Computing Budget Allocation for Efficient Ranking and Selection of Variances With Applicationto Target Tracking AlgorithmsIEEE Transactions on Automatic Control, 2004
- Discrete-event simulation optimization using ranking, selection, and multiple comparison proceduresACM Transactions on Modeling and Computer Simulation, 2003
- An empirical evaluation of several methods to select the best systemACM Transactions on Modeling and Computer Simulation, 1999
- Comparing Systems via Simulation1998
- A lower bound for the correct subset-selection probability and its application to discrete-event system simulationsIEEE Transactions on Automatic Control, 1996
- A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulationCommunications in Statistics - Simulation and Computation, 1985
- On two-stage selection procedures and related probability-inequalitiesCommunications in Statistics - Theory and Methods, 1978
- On Some Multiple Decision (Selection and Ranking) RulesTechnometrics, 1965