Affiliation:
1. IBM Tokyo Research Laboratory, Kanagawa, Japan
Abstract
We propose an indifference-zone approach for a ranking and selection problem with the goal of reducing both the number of simulated samples of the performance and the frequency of configuration changes. We prove that with a prespecified high probability, our algorithm finds the best system configuration. Our proof hinges on several ideas, including the use of Anderson's probability bound, that have not been fully investigated for the ranking and selection problem. Numerical experiments show that our algorithm can select the best system configuration using up to 50% fewer simulated samples than existing algorithms without increasing the frequency of configuration changes.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modelling and Simulation
Reference21 articles.
1. A Modification of the Sequential Probability Ratio Test to Reduce the Sample Size
2. Bechhofer R. E. Santner T. J. and Goldsman D. M. 1995. Design and Analysis of Experiments for Statistical Selection Screening and Multiple Comparisons. John Wiley & Sons New York. Bechhofer R. E. Santner T. J. and Goldsman D. M. 1995. Design and Analysis of Experiments for Statistical Selection Screening and Multiple Comparisons. John Wiley & Sons New York.
3. Using Ranking and Selection to “Clean Up” after Simulation Optimization
4. Computing efforts allocation for ordinal optimization and discrete event simulation
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献