IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v325y2025i2p247-260.html

A budget-adaptive allocation rule for optimal computing budget allocation

Author

Listed:
  • Cao, Zirui
  • Wang, Haowei
  • Chew, Ek Peng
  • Li, Haobin
  • Tan, Kok Choon

Abstract

Simulation-based ranking and selection (R&S) is a popular technique for optimizing discrete-event systems (DESs). It evaluates the mean performance of system designs by simulation outputs and aims to identify the best system design from a set of alternatives by intelligently allocating a limited simulation budget. In R&S, the optimal computing budget allocation (OCBA) is an efficient budget allocation rule that asymptotically maximizes the probability of correct selection (PCS). In this paper, we first show the asymptotic OCBA rule can be recovered by considering a large-scale problem with a specific large budget. Considering a sufficiently large budget can greatly simplify computations, but it also causes the asymptotic OCBA rule ignoring the impact of budget. To address this, we then derive a budget-adaptive rule under the setting where budget is not large enough to simplify computations. The proposed budget-adaptive rule determines the ratio of total budget allocated to designs based on the budget size, and its budget-adaptive property highlights the significant impact of budget on allocation strategy. Based on the proposed budget-adaptive rule, two heuristic algorithms are developed. In the numerical experiments, the superior efficiency of our proposed allocation rule is shown.

Suggested Citation

  • Cao, Zirui & Wang, Haowei & Chew, Ek Peng & Li, Haobin & Tan, Kok Choon, 2025. "A budget-adaptive allocation rule for optimal computing budget allocation," European Journal of Operational Research, Elsevier, vol. 325(2), pages 247-260.
    • Handle: RePEc:eee:ejores:v:325:y:2025:i:2:p:247-260
    DOI: 10.1016/j.ejor.2025.04.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725002656
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.04.015?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Zhongshun Shi & Yijie Peng & Leyuan Shi & Chun-Hung Chen & Michael C. Fu, 2022. "Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 557-568, January.
    2. Ying Zhong & L. Jeff Hong, 2022. "Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments," Operations Research, INFORMS, vol. 70(1), pages 432-453, January.
    3. Siyang Gao & Weiwei Chen, 2016. "A new budget allocation framework for selecting top simulated designs," IISE Transactions, Taylor & Francis Journals, vol. 48(9), pages 855-863, September.
    4. Jie Xu & Edward Huang & Liam Hsieh & Loo Hay Lee & Qing-Shan Jia & Chun-Hung Chen, 2016. "Simulation optimization in the era of Industrial 4.0 and the Industrial Internet," Journal of Simulation, Taylor & Francis Journals, vol. 10(4), pages 310-320, November.
    5. Ye Chen & Ilya O. Ryzhov, 2023. "Balancing Optimal Large Deviations in Sequential Selection," Management Science, INFORMS, vol. 69(6), pages 3457-3473, June.
    6. Weiwei Fan & L. Jeff Hong & Barry L. Nelson, 2016. "Indifference-Zone-Free Selection of the Best," Operations Research, INFORMS, vol. 64(6), pages 1499-1514, December.
    7. L. Jeff Hong & Guangxin Jiang & Ying Zhong, 2022. "Solving Large-Scale Fixed-Budget Ranking and Selection Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2930-2949, November.
    8. Shi, Yue & Xiang, Yisha & Xiao, Hui & Xing, Liudong, 2021. "Joint optimization of budget allocation and maintenance planning of multi-facility transportation infrastructure systems," European Journal of Operational Research, Elsevier, vol. 288(2), pages 382-393.
    9. Jun Luo & L. Jeff Hong & Barry L. Nelson & Yang Wu, 2015. "Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments," Operations Research, INFORMS, vol. 63(5), pages 1177-1194, October.
    10. 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.
    11. Cheng, Zhenxia & Luo, Jun & Wu, Ruijing, 2023. "On the finite-sample statistical validity of adaptive fully sequential procedures," European Journal of Operational Research, Elsevier, vol. 307(1), pages 266-278.
    12. Ilya O. Ryzhov, 2016. "On the Convergence Rates of Expected Improvement Methods," Operations Research, INFORMS, vol. 64(6), pages 1515-1528, December.
    13. Yijie Peng & Chun-Hung Chen & Michael C. Fu & Jian-Qiang Hu, 2016. "Dynamic Sampling Allocation and Design Selection," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 195-208, May.
    14. David J. Eckman & Shane G. Henderson, 2022. "Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1711-1728, May.
    15. Susan R. Hunter & Raghu Pasupathy, 2013. "Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 527-542, August.
    16. Ilya O. Ryzhov & Warren B. Powell & Peter I. Frazier, 2012. "The Knowledge Gradient Algorithm for a General Class of Online Learning Problems," Operations Research, INFORMS, vol. 60(1), pages 180-195, February.
    17. Stephen E. Chick & Jürgen Branke & Christian Schmidt, 2010. "Sequential Sampling to Myopically Maximize the Expected Value of Information," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 71-80, February.
    18. Hui Xiao & Fei Gao & Loo Hay Lee, 2020. "Optimal computing budget allocation for complete ranking with input uncertainty," IISE Transactions, Taylor & Francis Journals, vol. 52(5), pages 489-499, May.
    19. Stephen E. Chick & Koichiro Inoue, 2001. "New Two-Stage and Sequential Procedures for Selecting the Best Simulated System," Operations Research, INFORMS, vol. 49(5), pages 732-743, October.
    20. 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.
    21. 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.
    22. 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.
    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. Gongbo Zhang & Yijie Peng & Jianghua Zhang & Enlu Zhou, 2023. "Asymptotically Optimal Sampling Policy for Selecting Top- m Alternatives," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1261-1285, November.
    2. Zhongshun Shi & Yijie Peng & Leyuan Shi & Chun-Hung Chen & Michael C. Fu, 2022. "Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 557-568, January.
    3. Li, Dongyang & Chew, Ek Peng & Li, Haobin & Yücesan, Enver & Chen, Chun-Hung, 2026. "Efficient simulation budget allocation for contextual ranking and selection with quadratic models," European Journal of Operational Research, Elsevier, vol. 328(3), pages 862-876.
    4. Daniel Russo, 2020. "Simple Bayesian Algorithms for Best-Arm Identification," Operations Research, INFORMS, vol. 68(6), pages 1625-1647, November.
    5. 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.
    6. Wang, Tianxiang & Xu, Jie & Branke, Juergen & Hu, Jian-Qiang & Chen, Chun-Hung, 2025. "Ranking and selection with two-stage decision," European Journal of Operational Research, Elsevier, vol. 322(1), pages 121-132.
    7. L. Jeff Hong & Guangxin Jiang & Ying Zhong, 2022. "Solving Large-Scale Fixed-Budget Ranking and Selection Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2930-2949, November.
    8. Saeid Delshad & Amin Khademi, 2020. "Information theory for ranking and selection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 239-253, June.
    9. 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.
    10. Zhong, Ying & Du, Jianzhong & Li, Deng-Feng & Hu, Zhaolin, 2025. "Reference alternatives based knockout-tournament procedure for ranking and selection," European Journal of Operational Research, Elsevier, vol. 320(3), pages 628-641.
    11. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    12. Ye Chen & Ilya O. Ryzhov, 2023. "Balancing Optimal Large Deviations in Sequential Selection," Management Science, INFORMS, vol. 69(6), pages 3457-3473, June.
    13. Haihui Shen & L. Jeff Hong & Xiaowei Zhang, 2021. "Ranking and Selection with Covariates for Personalized Decision Making," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1500-1519, October.
    14. Cheng Li & Siyang Gao & Jianzhong Du, 2023. "Convergence Analysis of Stochastic Kriging-Assisted Simulation with Random Covariates," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 386-402, March.
    15. Michael Macgregor Perry & Hadi El-Amine, 2021. "Computational Efficiency in Multivariate Adversarial Risk Analysis Models," Papers 2110.12572, arXiv.org.
    16. Rojas Gonzalez, Sebastian & Branke, Juergen & Van Nieuwenhuyse, Inneke, 2025. "Bi-objective ranking and selection using stochastic kriging," European Journal of Operational Research, Elsevier, vol. 322(2), pages 599-614.
    17. Ilya O. Ryzhov, 2016. "On the Convergence Rates of Expected Improvement Methods," Operations Research, INFORMS, vol. 64(6), pages 1515-1528, December.
    18. Michael Perry & Hadi El-Amine, 2019. "Computational Efficiency in Multivariate Adversarial Risk Analysis Models," Decision Analysis, INFORMS, vol. 16(4), pages 314-332, December.
    19. Tsai, Shing Chih & Jiang, Guangxin, 2025. "Adaptive sequential selection procedures for optimal quantile with control variates," European Journal of Operational Research, Elsevier, vol. 326(3), pages 515-529.
    20. David J. Eckman & Shane G. Henderson, 2022. "Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1711-1728, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:325:y:2025:i:2:p:247-260. 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.