Please use this identifier to cite or link to this item:
|Title:||Efficient simulation budget allocation with regression|
|Keywords:||Optimal computing budget allocation|
Optimization using regression
|Citation:||Brantley, M.W., Lee, L.H., Chen, C.-H., Chen, A. (2013). Efficient simulation budget allocation with regression. IIE Transactions (Institute of Industrial Engineers) 45 (3) : 291-308. ScholarBank@NUS Repository. https://doi.org/10.1080/0740817X.2012.712238|
|Abstract:||Simulation can be a very powerful tool to help decision making in many applications; however, exploring multiple courses of actions can be time consuming. Numerous Ranking & Selection (R&S) procedures have been developed to enhance the simulation efficiency of finding the best design. This article explores the potential of further enhancing R&S efficiency by incorporating simulation information from across the domain into a regression metamodel. This article assumes that the underlying function to be optimized is one-dimensional as well as approximately quadratic or piecewise quadratic. Under some common conditions in most regressionbased approaches, 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. Numerical experiments demonstrate that the proposed approach can dramatically enhance efficiency over existing efficient R&S methods and can obtain significant savings over regressionbased methods. In addition to utilizing concepts from the Design Of Experiments (DOE) literature, it introduces the probability of correct selection optimality criterion that underpins our new R&S method to the DOE literature.|
|Source Title:||IIE Transactions (Institute of Industrial Engineers)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jun 19, 2018
checked on Jul 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.