PyPRS: A Python Software Package for Parallel Ranking and Selection Procedures

Published Online:https://doi.org/10.1287/ijoc.2024.1045

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.CrossrefGoogle 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.CrossrefGoogle Scholar
  • Chick SE (2006) Subjective probability and Bayesian methodology. Henderson SG, Nelson BL, eds. Handbooks in Operations Research and Management Science: Simulation (Elsevier, Amsterdam), 225–257.Google Scholar
  • Chick SE, Inoue K (2001) New procedures to select the best simulated system using common random numbers. Management Sci. 47(8):1133–1149.Google Scholar
  • Cooper K, Hunter SR (2020) PyMOSO: Software for multiobjective simulation optimization with R-PERLE and R-MinRLE. INFORMS J. Comput. 32(4):1101–1108.AbstractGoogle Scholar
  • Eckman DJ, Henderson SG, Shashaani S (2023) SimOpt: A testbed for simulation-optimization experiments. INFORMS J. Comput. 35(2):495–508.LinkGoogle Scholar
  • Frazier PI, Powell W, Dayanik S (2008) A knowledge-gradient policy for sequential information collection. SIAM J. Control Optim. 47(5):2410–2439.CrossrefGoogle Scholar
  • Glynn P, Juneja S (2004) A large deviations perspective on ordinal optimization. Ingalls RG, Rossetti MD, Smith JS, Peters BA, eds. Proc. 2004 Winter Simulation Conf. (IEEE, Piscataway, NJ), 577–585.CrossrefGoogle Scholar
  • Heidelberger P (1988) Discrete event simulations and parallel processing: Statistical properties. SIAM J. Sci. Statist. Comput. 9(6):1114–1132.CrossrefGoogle Scholar
  • Hong LJ (2006) Fully sequential indifference-zone selection procedures with variance-dependent sampling. Naval Res. Logist. 53(5):464–476.CrossrefGoogle Scholar
  • Hong LJ, Fan W, Luo J (2021) Review on ranking and selection: A new perspective. Frontiers Engrg. Management 8(3):321–343.CrossrefGoogle Scholar
  • Hong LJ, Jiang G, Zhong Y (2022) Solving large-scale fixed-budget ranking and selection problems. INFORMS J. Comput. 34(6):2930–2949.LinkGoogle Scholar
  • Huang S, Jiang G, Zhong Y (2025) PyPRS: A Python software package for parallel ranking and selection procedures. https://doi.org/10.1287/ijoc.2024.1045.cd, https://github.com/INFORMSJoC/2024.1045.Google Scholar
  • Kim SH, Nelson BL (2001) A fully sequential procedure for indifference-zone selection in simulation. ACM Trans. Model. Comput. Simulation 11(3):251–273.CrossrefGoogle Scholar
  • Kim SH, Nelson BL (2006) Selecting the best system. Henderson SG, Nelson BL, eds. Handbooks in Operations Research and Management Science: Simulation (Elsevier, Amsterdam), 501–534.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.LinkGoogle 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.LinkGoogle Scholar
  • L’Ecuyer P (1999) Good parameters and implementations for combined multiple recursive random number generators. Oper. Res. 47(1):159–164.LinkGoogle Scholar
  • L’Ecuyer P, Simard R, Chen EJ, Kelton WD (2002) An object-oriented random-number package with many long streams and substreams. Oper. Res. 50(6):1073–1075.LinkGoogle Scholar
  • Moritz P, Nishihara R, Wang S, Tumanov A, Liaw R, Liang E, Elibol M, et al. (2018) Ray: A distributed framework for emerging AI applications. Proc. 13th USENIX Conf. Oper. Systems Design Implementation (USENIX Association, Berkeley, CA), 561–577.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.LinkGoogle 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.CrossrefGoogle Scholar
  • Pei L, Nelson BL, Hunter SR (2022) Parallel adaptive survivor selection. Oper. Res. 72(1):336–354.LinkGoogle Scholar
  • Peng Y, Chong EK, Chen CH, Fu MC (2017) Ranking and selection as stochastic control. IEEE Trans. Automatic Control 63(8):2359–2373.CrossrefGoogle Scholar
  • Rinott Y (1978) On two-stage selection procedures and related probability-inequalities. Comm. Statist. Theory Methods 7(8):799–811.CrossrefGoogle 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.LinkGoogle 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.LinkGoogle 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.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.