Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.ejor.2005.02.052
Title: | A general framework on the simulation-based optimization under fixed computing budget | Authors: | Lee, L.H. Chew, E.P. Manikam, P. |
Keywords: | Assemble-to-order Optimal computing budget allocation Ranking and selection Sample average approximation Simulation |
Issue Date: | 1-Nov-2006 | Citation: | Lee, L.H., Chew, E.P., Manikam, P. (2006-11-01). A general framework on the simulation-based optimization under fixed computing budget. European Journal of Operational Research 174 (3) : 1828-1841. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2005.02.052 | Abstract: | In many real world problems, the design space is huge and the estimation of performance measure has to rely on simulation which is time-consuming. Hence, to find the optimal design in the design space based on the simulation output is not trivial. It is important to have a computing time allocation rule to decide how much effort to spend in sampling the design space, how many designs to sample, and how long to run for each design alternative within a given computing budget. In this paper, we propose a framework for making these allocation decisions. We use the problem of assemble-to-order (ATO) systems to demonstrate how this framework can be applied. The sample average approximation (SAA) method is chosen as the sampling method used in this application example. The numerical results show that this framework provides a good basis for allocation decisions. © 2005 Elsevier B.V. All rights reserved. | Source Title: | European Journal of Operational Research | URI: | http://scholarbank.nus.edu.sg/handle/10635/54190 | ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2005.02.052 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.