Please use this identifier to cite or link to this item:
|Title:||Simulation optimization using the cross-entropy method with optimal computing budget allocation|
|Keywords:||Computing budget allocation|
Estimation of distribution algorithms
|Citation:||He, D., Lee, L.H., Chen, C.-H., Fu, M.C., Wasserkrug, S. (2010-01-01). Simulation optimization using the cross-entropy method with optimal computing budget allocation. ACM Transactions on Modeling and Computer Simulation 20 (1) : -. ScholarBank@NUS Repository. https://doi.org/10.1145/1667072.1667076|
|Abstract:||We propose to improve the efficiency of simulation optimization by integrating the notion of optimal computing budget allocation into the Cross-Entropy (CE) method, which is a global optimization search approach that iteratively updates a parameterized distribution from which candidate solutions are generated. This article focuses on continuous optimization problems. In the stochastic simulation setting where replications are expensive but noise in the objective function estimate could mislead the search process, the allocation of simulation replications can make a significant difference in the performance of such global optimization search algorithms. A new allocation scheme is developed based on the notion of optimal computing budget allocation. The proposed approach improves the updating of the sampling distribution by carrying out this computing budget allocation in an efficient manner, by minimizing the expected mean-squared error of the CE weight function. Numerical experiments indicate that the computational efficiency of the CE method can be substantially improved if the ideas of computing budget allocation are applied. © 2010 ACM.|
|Source Title:||ACM Transactions on Modeling and Computer Simulation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
WEB OF SCIENCETM
checked on May 1, 2018
checked on Feb 25, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.