No Access

Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure

SISU School of Business and Management, Shanghai International Studies University, Shanghai 200083, P. R. China

Institute of Intelligent Operations and Supply Chain Management, Shanghai International Studies University, Shanghai 200083, P. R. China

E-mail Address: wuruijing9128@sina.com

Search for more papers by this author

Shaoxuan Liu

Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, P. R. China

E-mail Address: liusx@sjtu.edu.cn

Corresponding author.

Search for more papers by this author

, and

Zhenyang Shi

School of Management, Zhejiang University, Hangzhou, Zhejiang 310058, P. R. China

E-mail Address: shizhenyangcn@gmail.com

Search for more papers by this author

https://doi.org/10.1142/S0217595920500153Cited by:2 (Source: Crossref)

Abstract

In some fully sequential ranking and selection procedures, such as the KN procedure and Rinott’s procedure, some initial samples must be taken to estimate the variance. We analyze the impact of the initial sample size (ISS) on the total sample size and propose an algorithm to calculate the ISS in this type of procedure. To better illustrate our approach, we implement this algorithm on the KN procedure and propose the KN-ISS procedure. Comprehensive numerical experiments reveal that this procedure can significantly improve the efficiency compared with the KN procedure and still deliver the desired probability of correct selection.

Keywords:

References

Andradóttir, S and S-H Kim (2010). Fully sequential procedures for comparing constrained systems via simulation. Naval Research Logistics, 57, 403–421. Crossref, Web of Science, Google Scholar
Bechhofer, RE (1954). A single-sample multiple decision procedure for ranking means of normal populations with known variances. The Annals of Mathematical Statistics, 25, 16–39. Crossref, Google Scholar
Bechhofer, RE, DM Goldsman, CW Dunnett and M Hartmann (1990). A comparison of the performances of procedures for selecting the normal population having the largest mean when populations have a common unknown variance. Communications in Statistics — Simulation and Computation, 19(3), 971–1006. Crossref, Web of Science, Google Scholar
Chen, C-H, SE Chick, LH Lee and NA Pujowidianto (2015). Ranking and selection: Efficient simulation budget allocation. In Handbook of Simulation Optimization, pp. 45–80. Springer. Crossref, Google Scholar
Chen, C-H, J Lin, E Yücesan and SE Chick (2000). Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic Systems, 10, 251–270. Crossref, Web of Science, Google Scholar
Chick, SE (2006). Subjective probability and bayesian methodology. In Handbooks in Operations Research and Management Science, Vol. 13, pp. 225–257, Elsevier. Google Scholar
Durbin, J (1985). The first-passage density of a continuous gaussian process to a general boundary. Journal of Applied Probability, 22(1), 99–122. Crossref, Web of Science, Google Scholar
Fabian, V (1974). Note on Anderson’s sequential procedures with triangular boundary. The Annals of Statistics, 2, 170–176. Crossref, Web of Science, Google Scholar
Fan, W, LJ Hong and BL Nelson (2016). Indifference-zone-free selection of the best. Operations Research, 64(6), 1499–1514. Crossref, Web of Science, Google Scholar
Frazier, PI (2010). Decision-theoretic foundations of simulation optimization. Wiley Encyclopedia of Operations Research and Management Science. Google Scholar
Hartmann, M . (1991). An improvement on paulson’s procedure for selecting the population with the largest mean from $k$ normal populations with a common unknown variance. Sequential Analysis, 10(1–2), 1–16. Crossref, Google Scholar
Healey, C, S Andradóttir and S-H Kim (2013). Efficient comparison of constrained systems using dormancy. European Journal of Operational Research, 224, 340–352. Crossref, Web of Science, Google Scholar
Hong, LJ (2006). Fully sequential indifference-zone selection procedures with variance-dependent sampling. Naval Research Logistics, 53, 464–476. Crossref, Web of Science, Google Scholar
Jennison, C, IM Johnstone and BW Turnbull (1980). Asymptotically optimal procedures for sequential adaptive selection of the best of several normal means. Technical Report, Department of Operations Research and Industrial Engineering, Cornell University. Google Scholar
Kim, S-H and BL Nelson (2001). A fully sequential procedure for indifference-zone selection in simulation. ACM Transactions on Modeling and Computer Simulation, 11, 251–273. Crossref, Google Scholar
Kim, S-H and BL Nelson (2006), Selecting the best system. In Handbooks in Operations Research and Management Science, Vol. 13, pp. 501–534, Elsevier. Google Scholar
Law, A (2006). Simulation Modeling and Analysis. 4th Edition. Mcgraw Hill Higher Education. Google Scholar
Luo J, LJ Hong, BL Nelson and Y Wu (2015). Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments. Operations Research, 63(5), 1177–1194. Crossref, Web of Science, Google Scholar
Paulson, E (1964). A sequential procedure for selecting the population with the largest mean from $k$ normal populations. The Annals of Mathematical Statistics, 35, 174–180. Crossref, Google Scholar
Peng, Y, C Chen, MC Fu and J Hu (2018a). Gradient-based myopic allocation policy: An efficient sampling procedure in a low-confidence scenario. IEEE Transactions on Automatic Control, 63(9), 3091–3097. Crossref, Web of Science, Google Scholar
Peng, Y, EKP Chong, C Chen and MC Fu (2018b). Ranking and selection as stochastic control. IEEE Transactions on Automatic Control, 63, 2359–2373. Crossref, Web of Science, Google Scholar
Peng, Y and MC Fu (2017). Myopic allocation policy with asymptotically optimal sampling rate. IEEE Transactions on Automatic Control, 62(4), 2041–2047. Crossref, Web of Science, Google Scholar
Perng, SK (1969). A comparison of the asymptotic expected sample sizes of two sequential procedures for ranking problem. The Annals of Mathematical Statistics, 40, 2198–2202. Crossref, Google Scholar
Tsai, SC, J Luo and CC Sung (2017). Combined variance reduction techniques in fully sequential selection procedures. Naval Research Logistics, 64(6), 502–527. Crossref, Web of Science, Google Scholar
Wang, H and S-H Kim (2013). Reducing the conservativeness of fully sequential indifference-zone procedures. IEEE Transactions on Automatic Control, 58, 1613–1619. Crossref, Web of Science, Google Scholar
Wu, R, S Liu and J Luo (2017). Adaptive sampling rule for ranking-and-selection problem. In 2017 13th IEEE Conf. Automation Science and Engineering (CASE), pp. 1499–1505. IEEE. Crossref, Google Scholar
Xiao, H, H Chen and LH Lee (2019). An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints. Automatica, 103, 106–115. Crossref, Web of Science, Google Scholar