Please use this identifier to cite or link to this item:
|Title:||Some efficient simulation budget allocation rules for simulation optimisation problems||Authors:||Lee, L.H.
Optimal computing budget allocation
Ranking and selection
|Issue Date:||2013||Citation:||Lee, L.H.,Chen, C.-H.,Chew, E.P.,Zhang, S.,Li, J.,Pujowidianto, N.A. (2013). Some efficient simulation budget allocation rules for simulation optimisation problems. International Journal of Services Operations and Informatics 8 (1) : 1-18. ScholarBank@NUS Repository. https://doi.org/10.1504/IJSOI.2013.059353||Abstract:||In service industry, various decisions need to be made to design these service systems or improve their performances. In the face of complex systems and many choices, simulation is used to estimate the performance measures of each alternative when analytical expression is too complex or even unavailable. As multiple replications are required for each design, there is a need to efficiently allocate the simulation budget. The Optimal Computing Budget Allocation (OCBA) is an approach that intelligently allocates simulation budget for maximising the desired selection quality in finding the best alternative(s) and has demonstrated its ability in significantly enhancing simulation efficiency. In this paper, we present three latest developments on OCBA for the optimal subset selection, constrained optimisation, and multiobjective optimisation problems. The models, the corresponding asymptotically optimal allocation rules, are provided together with numerical results showing their efficiency. The proposed rules are also further discussed from the large deviations perspective. Copyright © 2013 Inderscience Enterprises Ltd.||Source Title:||International Journal of Services Operations and Informatics||URI:||http://scholarbank.nus.edu.sg/handle/10635/87251||ISSN:||1741539X||DOI:||10.1504/IJSOI.2013.059353|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2022
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.