IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v273y2019i1p249-258.html
   My bibliography  Save this article

Considering sample means in Rinott’s procedure with a Bayesian approach

Author

Listed:
  • Yoon, Moonyoung
  • Bekker, James

Abstract

Ranking and selection procedures deal with a number of system designs from which the best must be selected. The indifference-zone type of ranking and selection procedures attempt to guarantee the probability of correct selection, P(CS), while minimizing the simulation computing effort. Many indifference-zone procedures assume the slippage configuration in order to show the statistical validity, which makes the procedures inefficient. There have been many efforts to design more efficient indifference-zone procedures by eliminating the slippage configuration, yet none of them is accompanied by a rigorous mathematical analysis that assures the P(CS) guarantee without using an asymptotic analysis. In this paper, we present a new indifference-zone procedure for ranking and selection. This procedure uses sample mean information instead of assuming the slippage configuration and is therefore less conservative than existing procedures, as it achieves a minimum stated probability of correct selection with lower computing effort. The procedure is statistically valid and mathematically proved using the Bayesian inference model. Experimental work conducted shows that the proposed procedure is robust and that it should be useful to the simulation community.

Suggested Citation

  • Yoon, Moonyoung & Bekker, James, 2019. "Considering sample means in Rinott’s procedure with a Bayesian approach," European Journal of Operational Research, Elsevier, vol. 273(1), pages 249-258.
  • Handle: RePEc:eee:ejores:v:273:y:2019:i:1:p:249-258
    DOI: 10.1016/j.ejor.2018.06.040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718305770
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2018.06.040?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Seong-Hee Kim & Barry L. Nelson, 2006. "On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation," Operations Research, INFORMS, vol. 54(3), pages 475-488, June.
    2. Chen, E. Jack & Kelton, W. David, 2005. "Sequential selection procedures: Using sample means to improve efficiency," European Journal of Operational Research, Elsevier, vol. 166(1), pages 133-153, October.
    3. Barry L. Nelson & Julie Swann & David Goldsman & Wheyming Song, 2001. "Simple Procedures for Selecting the Best Simulated System When the Number of Alternatives is Large," Operations Research, INFORMS, vol. 49(6), pages 950-963, December.
    4. Michael C. Fu & Jian-Qiang Hu & Chun-Hung Chen & Xiaoping Xiong, 2007. "Simulation Allocation for Determining the Best Design in the Presence of Correlated Sampling," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 101-111, February.
    5. Loo Lee & Ek Chew & Suyan Teng & David Goldsman, 2010. "Finding the non-dominated Pareto set for multi-objective simulation models," IISE Transactions, Taylor & Francis Journals, vol. 42(9), pages 656-674.
    6. Stephen E. Chick & Yaozhong Wu, 2005. "Selection Procedures with Frequentist Expected Opportunity Cost Bounds," Operations Research, INFORMS, vol. 53(5), pages 867-878, October.
    7. Jürgen Branke & Stephen E. Chick & Christian Schmidt, 2007. "Selecting a Selection Procedure," Management Science, INFORMS, vol. 53(12), pages 1916-1932, December.
    8. Chun-Hung Chen & Donghai He & Michael Fu & Loo Hay Lee, 2008. "Efficient Simulation Budget Allocation for Selecting an Optimal Subset," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 579-595, November.
    9. Teng, Suyan & Lee, Loo Hay & Chew, Ek Peng, 2010. "Integration of indifference-zone with multi-objective computing budget allocation," European Journal of Operational Research, Elsevier, vol. 203(2), pages 419-429, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Healey, Christopher M. & Andradóttir, Sigrún & Kim, Seong-Hee, 2013. "Efficient comparison of constrained systems using dormancy," European Journal of Operational Research, Elsevier, vol. 224(2), pages 340-352.
    2. Jürgen Branke & Stephen E. Chick & Christian Schmidt, 2007. "Selecting a Selection Procedure," Management Science, INFORMS, vol. 53(12), pages 1916-1932, December.
    3. Zhongshun Shi & Siyang Gao & Hui Xiao & Weiwei Chen, 2019. "A worst‐case formulation for constrained ranking and selection with input uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(8), pages 648-662, December.
    4. Qiushi Chen & Lei Zhao & Jan C. Fransoo & Zhe Li, 2019. "Dual-mode inventory management under a chance credit constraint," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 147-178, March.
    5. Wang, Tianxiang & Xu, Jie & Hu, Jian-Qiang & Chen, Chun-Hung, 2023. "Efficient estimation of a risk measure requiring two-stage simulation optimization," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1355-1365.
    6. Siyang Gao & Weiwei Chen & Leyuan Shi, 2017. "A New Budget Allocation Framework for the Expected Opportunity Cost," Operations Research, INFORMS, vol. 65(3), pages 787-803, June.
    7. Tsai, Shing Chih & Fu, Sheng Yang, 2014. "Genetic-algorithm-based simulation optimization considering a single stochastic constraint," European Journal of Operational Research, Elsevier, vol. 236(1), pages 113-125.
    8. Groves, Matthew & Branke, Juergen, 2019. "Top-κ selection with pairwise comparisons," European Journal of Operational Research, Elsevier, vol. 274(2), pages 615-626.
    9. Demet Batur & Lina Wang & F. Fred Choobineh, 2018. "Methods for System Selection Based on Sequential Mean–Variance Analysis," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 724-738, November.
    10. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    11. Juergen Branke & Wen Zhang, 2019. "Identifying efficient solutions via simulation: myopic multi-objective budget allocation for the bi-objective case," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 831-865, September.
    12. Teng, Suyan & Lee, Loo Hay & Chew, Ek Peng, 2010. "Integration of indifference-zone with multi-objective computing budget allocation," European Journal of Operational Research, Elsevier, vol. 203(2), pages 419-429, June.
    13. Huashuai Qu & Ilya O. Ryzhov & Michael C. Fu & Zi Ding, 2015. "Sequential Selection with Unknown Correlation Structures," Operations Research, INFORMS, vol. 63(4), pages 931-948, August.
    14. Tsai, Shing Chih & Chu, I-Hao, 2012. "Controlled multistage selection procedures for comparison with a standard," European Journal of Operational Research, Elsevier, vol. 223(3), pages 709-721.
    15. Shing Chih Tsai & Chen Hao Kuo, 2012. "Screening and selection procedures with control variates and correlation induction techniques," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 340-361, August.
    16. Mattila, V. & Virtanen, K., 2015. "Ranking and selection for multiple performance measures using incomplete preference information," European Journal of Operational Research, Elsevier, vol. 242(2), pages 568-579.
    17. Lee, Loo Hay & Chew, Ek Peng & Manikam, Puvaneswari, 2006. "A general framework on the simulation-based optimization under fixed computing budget," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1828-1841, November.
    18. Flötteröd, Gunnar, 2017. "A search acceleration method for optimization problems with transport simulation constraints," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 239-260.
    19. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    20. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:273:y:2019:i:1:p:249-258. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.