Optimal computing budget allocation: Difference between revisions

Content deleted Content added
OAbot (talk | contribs)
m Open access bot: doi updated in citation with #oabot.
Citation bot (talk | contribs)
Altered template type. Add: arxiv, doi, page, issue, volume, journal, bibcode. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 970/990
 
(5 intermediate revisions by 4 users not shown)
Line 4:
Simply put, OCBA ensures that computational resources are distributed efficiently by allocating more simulation effort to design alternatives that are harder to evaluate or more likely to be the best. This allows researchers and decision-makers to achieve accurate results faster and with fewer resources.
 
OCBA has also been shown to enhance partition-based random search algorithms for solving deterministic global optimization problems.<ref name="Chen2014">{{cite journal | last1=Chen | first1=Wei | last2=Gao | first2=Siyang | last3=Chen | first3=Chun-Hung | last4=Shi | first4=Lei | title=An Optimal Sample Allocation Strategy for Partition-Based Random Search | journal=IEEE Transactions on Automation Science and Engineering | year=2014 | volume=11 | issue=1 | pages=177–186 | url=https://www.researchgate.net/publication/260721040 | publisher=IEEE | doi=10.1109/TASE.2013.2251881 | bibcode=2014ITASE..11..177C }}</ref> Over the years, OCBA has been applied in manufacturing systems design, healthcare planning, and financial modeling. It has also been extended to handle more complex scenarios, such as balancing multiple objectives,<ref name="Lee2012">{{cite journal | last1=Lee | first1=Loo Hay | last2=Li | first2=Li Wei | last3=Chen | first3=Chun-Hung | last4=Yap | first4=C. M. | title=Approximation Simulation Budget Allocation for Selecting the Best Design in the Presence of Stochastic Constraints | journal=IEEE Transactions on Automatic Control | year=2012 | volume=57 | issue=12 | pages=2940–2945 | doi=10.1109/TAC.2012.2204478 | doi-broken-date=151 DecemberJuly 20242025 | url=https://ieeexplore.ieee.org/document/5371030 }}</ref> feasibility determination,<ref name="Szechtman2008">{{cite conference | last1=Szechtman | first1=R. | last2=Yücesan | first2=E. | title=A New Perspective on Feasibility Determination | book-title=Proceedings of the 2008 Winter Simulation Conference | year=2008 | pages=273–280 | url=https://informs-sim.org/wsc08papers/005.pdf }}</ref> and constrained optimization.<ref name="Gao2017">{{cite journal | last1=Gao | first1=Shu | last2=Xiao | first2=Hongsheng | last3=Zhou | first3=Enlu | last4=Chen | first4=Wei | title=Robust Ranking and Selection with Optimal Computing Budget Allocation | journal=Automatica | year=2017 | volume=81 | pages=30–36 | doi=10.1016/j.automatica.2017.03.015 | url=https://www.sciencedirect.com/science/article/abs/pii/S0005109817301070 }}</ref>
 
== Intuitive Explanation ==
Line 172:
* <math>\delta_{i,j}=\mu_i-\mu_j</math>.
 
The budget allocation problem with the EOC objective measure is given by Gao et al. (2017)<ref>{{cite journal | url=https://pubsonline.informs.org/doi/abs/10.1287/opre.2016.1581 | doi=10.1287/opre.2016.1581 | title=A New Budget Allocation Framework for the Expected Opportunity Cost | date=2017 | last1=Gao | first1=Siyang | last2=Chen | first2=Weiwei | last3=Shi | first3=Leyuan | journal=Operations Research | volume=65 | issue=3 | pages=787–803 | url-access=subscription }}</ref>
: <math>
\begin{align}
Line 204:
 
* '''Monte Carlo Tree Search (MCTS):'''
** A 2020 study proposed an OCBA-based tree policy for MCTS, optimizing computational resource allocation to maximize the probability of correct action selection. This approach maximizes the probability of correct action selection under limited sampling budgets by dynamically balancing exploration of less-sampled actions and exploitation of promising ones.<ref>{{cite journal | last1=Li | first1=Yunchuan | last2=Fu | first2=Michael C. | last3=Xu | first3=Jie | title=An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search | journal=arXivIEEE preprintTransactions on Automatic Control | yeardate=2020 | volume=200967 | issue=124076 | page=2685 | doi=10.1109/TAC.2021.3088792 | arxiv=2009.12407 | bibcode=2022ITAC...67.2685L }}</ref>
 
* '''Online Serving Systems:'''
** The Distributed Asynchronous Optimal Computing Budget Allocation (DA-OCBA) framework applies OCBA principles in a cloud computing environment for simulation optimization. By utilizing idle docker containers and enabling asynchronous execution of simulation tasks, DA-OCBA improves the efficiency of simulation optimization in large-scale systems. The framework demonstrates significant computational savings and scalability, making it particularly useful in applications such as cloud-based resource allocation systems.<ref>{{cite journal | last1=Wang | first1=Yu | last2=Tang | first2=Wei | last3=Yao | first3=Yan | last4=Zhu | first4=Fang | title=DA-OCBA: Distributed Asynchronous Optimal Computing Budget Allocation Algorithm of Simulation Optimization Using Cloud Computing | journal=Symmetry | year=2019 | volume=11 | issue=10 | pages=1297 | doi=10.3390/sym11101297 | doi-access=free | bibcode=2019Symm...11.1297W }}</ref>
*'''Digital Twinning and Decision Support Systems for Maintaining A Resilient Port:'''
**As real-world physical systems become increasingly more elaborate and subject to wide-ranging external factors and disruptions, it becomes necessary to develop mechanisms to both monitor changes and coordinate the successful operation of all the aspects of the system. A 2021 paper proposes OCBA as a means of ensuring the successful allocation of resources to reduce the impact of hazards and environmental factors that may block the timely transfer of cargo across ports. By implementing OCBA within a digital twin-based framework, decision makers will be able to use real-time data to optimize the number of simulation runs for each recovery alternative.<ref>{{cite journal | doi=10.1016/j.dss.2021.113496 | title=Analytics with digital-twinning: A decision support system for maintaining a resilient port | date=2021 | last1=Zhou | first1=Chenhao | last2=Xu | first2=Jie | last3=Miller-Hooks | first3=Elise | last4=Zhou | first4=Weiwen | last5=Chen | first5=Chun-Hung | last6=Lee | first6=Loo Hay | last7=Chew | first7=Ek Peng | last8=Li | first8=Haobin | journal=Decision Support Systems | volume=143 | article-number=113496 }}</ref>
 
These recent innovations demonstrate OCBA's growing versatility and effectiveness in optimizing resource allocation for diverse applications.
Line 217 ⟶ 219:
=== Applications ===
 
'''Predictive Multi-Fidelity Models:''' Gaussian Mixture Models (GMMs) predict relationships between low- and high-fidelity simulations, enabling OCBA to focus on the most promising alternatives. Multi-fidelity models combine insights from low-fidelity simulations, which are computationally inexpensive but less accurate, and high-fidelity simulations, which are more accurate but computationally intensive. The integration of GMMs into this process allows OCBA to strategically allocate computational resources across fidelity levels, significantly reducing simulation costs while maintaining decision accuracy.<ref>{{cite journal |last1=Peng |first1=Y. |last2=Xu |first2=J. |last3=Lee |first3=L. H. |last4=Hu |first4=J. |last5=Chen |first5=C. H. |title=Efficient Simulation Sampling Allocation Using Multifidelity Models |journal=IEEE Transactions on Automatic Control |year=2019 |volume=64 |issue=8 |pages=3156–3169 |doi=10.1109/TAC.2018.2886165 |urlbibcode=https://ieeexplore2019ITAC.ieee.org/document/8571289.64.3156P }}</ref>
 
'''Dynamic Resource Allocation in Healthcare:''' A Bayesian OCBA framework has been applied to allocate resources in hospital emergency departments, balancing service quality with operational efficiency. By minimizing expected opportunity costs, this approach supports real-time decision-making in high-stakes environments.<ref>{{cite journal | title=Optimizing Resource Allocation in Service Systems via Simulation: A Bayesian Formulation | journal=Production and Operations Management | year=2023 | doi=10.1111/poms.13825 | url=https://doi.org/10.1111/poms.13825 | last1=Chen | first1=Weiwei | last2=Gao | first2=Siyang | last3=Chen | first3=Wenjie | last4=Du | first4=Jianzhong | volume=32 | pages=65–81 | doi-access=free }}</ref> Additionally, the integration of OCBA with real-time digital twin-based optimization has further advanced its application in predictive simulation learning, enabling dynamic adjustments to resource allocation in healthcare settings.<ref>{{cite journal | last1=Goodwin | first1=Timothy | last2=Xu | first2=Jie | last3=Celik | first3=Niyazi | last4=Chen | first4=Chun-Hung | title=Real-Time Digital Twin-Based Optimization with Predictive Simulation Learning | journal=Journal of Simulation | year=2024 | volume=18 | issue=1 | pages=47–64 | doi=10.1080/17477778.2022.2046520 | url=https://www.tandfonline.com/doi/full/10.1080/17477778.2022.2046520 | url-access=subscription }}</ref> Furthermore, a contextual ranking and selection method for personalized medicine leverages OCBA to optimize resource allocation in treatments tailored to individual patient profiles, demonstrating its potential in personalized healthcare.<ref>{{cite journal | last1=Gao | first1=Siyang | last2=Du | first2=Jianzhong | last3=Chen | first3=Chun-Hung | title=A Contextual Ranking and Selection Method for Personalized Medicine | journal=Manufacturing and Service Operations Management | year=2024 | volume=26 | issue=1 | pages=167–181 | doi=10.1287/msom.2022.0232 | arxiv=2206.12640 | url=https://pubsonline.informs.org/doi/10.1287/msom.2022.0232 }}</ref>
 
'''Sequential Allocation using Machine-learning Predictions as Light-weight Estimates (SAMPLE):''' SAMPLE is an extension of OCBA that presents a new opportunity for the integration of machine learning with digital twins for real-time simulation optimization and decision-making. Current methods for applying machine learning on simulation data may not produce the optimal solution due to errors encountered during the predictive learning phase since training data can be limited. SAMPLE overcomes this issue by leveraging lightweight machine learning models, which are easy to train and interpret, then running additional simulations once the real-world context is captured through the digital twin.<ref>{{cite journal | doi=10.1080/17477778.2022.2046520 | title=Real-time digital twin-based optimization with predictive simulation learning | date=2024 | last1=Goodwin | first1=Travis | last2=Xu | first2=Jie | last3=Celik | first3=Nurcin | last4=Chen | first4=Chun-Hung | journal=Journal of Simulation | volume=18 | pages=47–64 }}</ref>
 
== References ==