Sciweavers

Share
WSC
2007

Extension of the direct optimization algorithm for noisy functions

4 years 28 days ago
Extension of the direct optimization algorithm for noisy functions
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both global exploration and local exploitation. In this paper, we modify the deterministic DIRECT algorithm to handle noisy function optimization. We adopt a simple approach that replicates multiple function evaluations per point and takes an average to reduce functional uncertainty. Particular features of the DIRECT method are modified using acquired Bayesian sample information to determine appropriate numbers of replications. The noisy version of the DIRECT algorithm is suited for simulation-based optimization problems. The algorithm is a sampling approach, that only uses objective function evaluations. We have applied the new algorithm in a number of noisy global optimizations, including an ambulance base simulation optimization problem.
Geng Deng, Michael C. Ferris
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2007
Where WSC
Authors Geng Deng, Michael C. Ferris
Comments (0)
books