# Efficient simulation budget allocation for subset selection using regression metamodels

@article{Gao2019EfficientSB, title={Efficient simulation budget allocation for subset selection using regression metamodels}, author={Fei Gao and Zhongshun Shi and Siyang Gao and Hui Xiao}, journal={Autom.}, year={2019}, volume={106}, pages={192-200} }

This research considers the ranking and selection (R&S) problem of selecting the optimal subset from a finite set of alternative designs. Given the total simulation budget constraint, we aim to maximize the probability of correctly selecting the top-m designs. In order to improve the selection efficiency, we incorporate the information from across the domain into regression metamodels. In this research, we assume that the mean performance of each design is approximately quadratic. To achieve a… Expand

#### Figures and Topics from this paper

#### 2 Citations

Simulation Optimization on Complex Job Shop Scheduling with Non-Identical Job Sizes

- Computer Science
- Asia Pac. J. Oper. Res.
- 2019

This paper addresses the complex job shop scheduling problem with the consideration of non-identical job sizes by proposing a genetic programming based hyper heuristic to generate efficient dispatching rules and a hybrid rule selection algorithm based on the nested partition framework. Expand

Stochastic resource-constrained project scheduling problem with time varying weather conditions and an improved estimation of distribution algorithm

- Computer Science
- Comput. Ind. Eng.
- 2021

An improved estimation of distribution algorithm (EDA) including a ranking and selection method using common random numbers is proposed for enhancing the performance of project scheduling in SRCPSP under time-varying weather conditions. Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

Optimal Budget Allocation Rule for Simulation Optimization Using Quadratic Regression in Partitioned Domains

- Mathematics, Computer Science
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- 2015

Using the large deviation theory, an asymptotically optimal allocation rule is proposed with the objective of maximizing the probability of correctly selecting the best design point in the simulation. Expand

An efficient simulation budget allocation method incorporating regression for partitioned domains

- Computer Science, Medicine
- Autom.
- 2014

This work proposes to partition the domain of interest such that in each partition the mean of the underlying function is approximately quadratic, and provides approximately optimal rules for between and within partitions that determine the number of samples allocated to each design location. Expand

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

- Mathematics, Computer Science
- INFORMS J. Comput.
- 2008

Preliminary numerical results indicate that the proposed new procedure has the potential to enhance computational efficiency for simulation optimization and the resulting allocations are superior to other methods in the literature that are tested, and the relative efficiency increases for larger problems. Expand

A new budget allocation framework for selecting top simulated designs

- Computer Science
- 2016

This article provides some useful insights on characterizing an efficient subset selection rule and how it can be achieved by adjusting the simulation budgets allocated to all of the designs. Expand

Advancing Constrained Ranking and Selection With Regression in Partitioned Domains

- Computer Science
- IEEE Transactions on Automation Science and Engineering
- 2019

This paper proposes a new R&S procedure using regression metamodels and defines the asymptotic optimal number of simulation replications for each design, motivated by the problem of selecting the best feasible design from a finite set of alternatives given an objective and stochastic constraints. Expand

Efficient simulation budget allocation with regression

- Computer Science
- 2013

The proposed method provides approximations of the optimal rules that determine the design locations to conduct simulation runs and the number of samples allocated to each design location and introduces the probability of correct selection optimality criterion that underpins the new R&S method to the DOE literature. Expand

Robust ranking and selection with optimal computing budget allocation

- Computer Science
- Autom.
- 2017

An approximated probability measure is developed and an asymptotically optimal solution of the resulting problem is derived, which is then designed within the optimal computing budget allocation (OCBA) framework. Expand

A Simulation Budget Allocation Procedure for Enhancing the Efficiency of Optimal Subset Selection

- Computer Science
- IEEE Transactions on Automatic Control
- 2016

A new procedure is developed which is more efficient and robust than currently existing procedures in the literature and achieves a higher convergence rate than other procedures under certain conditions. Expand

Selecting the Best Simulated Design With the Expected Opportunity Cost Bound

- Computer Science
- IEEE Transactions on Automatic Control
- 2015

Based on some approximations, an asymptotic closed-form allocation rule is derived for the selection problem, which is easy to compute and implement and shows that the proposed selection procedure can enhance the simulation efficiency significantly. Expand

Efficient subset selection for the expected opportunity cost

- Computer Science, Mathematics
- Autom.
- 2015

An efficient simulation budget allocation procedure, called E O C - m, is developed for selecting the top m designs from a finite set of design alternatives based on simulated outputs, subject to a constraint on the total number of samples available. Expand