Solving Large-Scale Fixed-Budget Ranking and Selection Problems

References

• Bechhofer RE (1954) A single-sample multiple decision procedure for ranking means of normal populations with known variances. Ann. Math. Statist. 25(1):16–39.Crossref, Google Scholar
• Bechhofer RE, Santner TJ, Goldsman DM (1995) Design and Analysis of Experiments for Statistical Selection, Screening, and Multiple Comparisons (John Wiley & Sons, New York).Google Scholar
• Buzacott JA, Shanthikumar JG (1993) Stochastic Models of Manufacturing Systems (Prentice Hall, Upper Saddle River, NJ).Google Scholar
• Chen CH, Donohue K, Yücesan E, Lin J (2003) Optimal computing budget allocation for Monte Carlo simulation with application to product design. Simulation Modeling Practice Theory 11(1):57–74.Crossref, Google Scholar
• Chen CH, Lin J, Yücesan E, Chick SE (2000) Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic Systems 10(3):251–270.Crossref, Google Scholar
• Chick SE (2006) Subjective probability and Bayesian methodology. Henderson SG, Nelson BL, eds. Elsevier Handbooks in Operations Research and Management Science: Simulation (Elsevier, New York), 225–257.Google Scholar
• Chick SE, Inoue K (2001) New two-stage and sequential procedures for selecting the best simulated system. Oper. Res. 49(5):732–743.Link, Google Scholar
• Chick SE, Branke J, Schmidt C (2010) Sequential sampling to myopically maximize the expected value of information. INFORMS J. Comput. 22(1):71–80.Link, Google Scholar
• Cramér H (1938) Sur un Nouveau Théoreme-Limite de la Théorie des Probabilités (Actualités Scientiques et Industrielles).Google Scholar
• Dudewicz EJ, Dalal SR (1975) Allocation of observations in ranking and selection with unequal variances. Indian J. Statist. B37:28–78.Google Scholar
• Even-Dar E, Mannor S, Mansour Y (2002) PAC bounds for multi-armed bandit and Markov decision processes. Kivinen J, Sloan R, eds. Proc. 15th Internat. Conf. on Comput. Learn. Theory (Springer, Berlin), 255–270.Google Scholar
• Fan W, Hong LJ, Nelson BL (2016) Indifference-zone-free selection of the best. Oper. Res. 64(6):1499–1514.Link, Google Scholar
• Fan W, Hong LJ, Zhang X (2020) Distributionally robust selection of the best. Management Sci. 66(1):190–208.Link, Google Scholar
• Frazier PI, Powell W, Dayanik S (2008) A knowledge-gradient policy for sequential information collection. SIAM J. Control Optim. 47(5):2410–2439.Crossref, Google Scholar
• Glynn P, Juneja S (2004) A large deviations perspective on ordinal optimization. Ingalls RG, Rossetti MD, Smith JS, Peters BA, eds. Proc. Winter Simulation Conf. (IEEE, Piscataway, NJ), 577–585.Google Scholar
• Henderson SG, Pasupathy R (2021) Simulation optimization library. Accessed August 26, 2021, https://github.com/simopt-admin/simopt/wiki.Google Scholar
• Hong LJ, Fan W, Luo J (2021) Review on ranking and selection: A new perspective. Frontiers Engrg. Management 8(3):321–343.Crossref, Google Scholar
• Hunter SR, Nelson BL (2017) Parallel ranking and selection. Tolk A, Fowler J, Shao G, Yücesan E, eds. Adv. Modeling Simulations: Seminal Res. 50 Years Winter Simulation Conf. (Springer, Cham, Switzerland), 249–275.Google Scholar
• Kim SH, Nelson BL (2001) A fully sequential procedure for indifference-zone selection in simulation. ACM Trans. Modeling Comput. Simulation 11(3):251–273.Crossref, Google Scholar
• Kim SH, Nelson BL (2006) Selecting the best system. Henderson SG, Nelson BL, eds. Elsevier Handbooks in Operations Research and Management Science: Simulation (Elsevier, New York), 501–534.Google Scholar
• Lan H, Nelson BL, Staum J (2010) A confidence interval procedure for expected shortfall risk measurement via two-level simulation. Oper. Res. 58(5):1481–1490.Link, Google Scholar
• Luo J, Hong LJ, Nelson BL, Wu Y (2015) Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments. Oper. Res. 63(5):1177–1194.Link, Google Scholar
• Luo X, Li L, Zhao L, Lin J (2022) Dynamic intra-cell repositioning in free-floating bike sharing systems using approximate dynamic programming. Transportation Sci. 56(4):799–826.Link, Google Scholar
• Ni EC, Ciocan DF, Henderson SG, Hunter SR (2017) Efficient ranking and selection in parallel computing environments. Oper. Res. 65(3):821–836.Link, Google Scholar
• Paulson E (1964) A sequential procedure for selecting the population with the largest mean from k normal populations. Ann. Math. Statist. 35(1):174–180.Crossref, Google Scholar
• Rinott Y (1978) On two-stage selection procedures and related probability-inequalities. Comm. Statist. Theory Methods A7:799–811.Crossref, Google Scholar
• Ryzhov IO (2016) On the convergence rates of expected improvement methods. Oper. Res. 64(6):1515–1528.Link, Google Scholar
• Shen H, Hong LJ, Zhang X (2021) Ranking and selection with covariates for personalized decision making. INFORMS J. Comput. 33(4):1500–1519.Abstract, Google Scholar
• Song R, Lau HC, Luo X, Zhao L (2022) Coordinated delivery to shopping malls with limited docking capacity. Transportation Sci. 56(2):501–527.Link, Google Scholar
• Waeber R, Frazier PI, Henderson SG (2010) Performance measures for ranking and selection procedures. Johansson B, Jain S, Montoya-Torres J, Hugan J, Yücesan E, eds. Proc. Winter Simulation Conf. (IEEE, Piscataway, NJ), 1235–1245.Google Scholar
• Wu D, Zhou E (2018a) Analyzing and provably improving fixed budget ranking and selection algorithms. Working paper, Georgia Institute of Technology, Atlanta.Google Scholar
• Wu D, Zhou E (2018b) Provably improving the optimal computing budget allocation algorithm. Rabe M, Juan AA, Mustafee N, Skoogh A, Jain S, Johansson B, eds. Proc. Winter Simulation Conf. (IEEE, Piscataway, NJ), 1921–1932.Google Scholar
• Xiao H, Lee LH, Morrice D, Chen CH, Hu X (2021) Ranking and selection for terminating simulation under sequential sampling. IISE Trans. 53(7):735–750.Crossref, Google Scholar
• Zhong Y, Hong LJ (2022) Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments. Oper. Res. 70(1):432–453.Link, Google Scholar
• Zhong Y, Liu S, Luo J, Hong LJ (2022) Speeding up Paulson’s procedure for large-scale problems using parallel computing. INFORMS J. Comput. 34(1):586–606.Link, Google Scholar