Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2304.02377 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909574333726720 |
|---|---|
| author | Cao, Zirui Wang, Haowei Chew, Ek Peng Li, Haobin Tan, Kok Choon |
| author_facet | Cao, Zirui Wang, Haowei Chew, Ek Peng Li, Haobin Tan, Kok Choon |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_02377 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Budget-Adaptive Allocation Rule for Optimal Computing Budget Allocation Cao, Zirui Wang, Haowei Chew, Ek Peng Li, Haobin Tan, Kok Choon Optimization and Control 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. |
| title | A Budget-Adaptive Allocation Rule for Optimal Computing Budget Allocation |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2304.02377 |