Article ID: | iaor2012243 |
Volume: | 34 |
Issue: | 3 |
Start Page Number: | 441 |
End Page Number: | 466 |
Publication Date: | Mar 2006 |
Journal: | Journal of Global Optimization |
Authors: | Huang D, Allen T, Notz W, Zeng N |
Keywords: | programming: probabilistic |
This paper proposes a new method that extends the efficient global optimization to address stochastic black‐box systems. The method is based on a kriging meta‐model that provides a global prediction of the objective values and a measure of prediction uncertainty at every point. The criterion for the infill sample selection is an augmented expected improvement function with desirable properties for stochastic responses. The method is empirically compared with the revised simplex search, the simultaneous perturbation stochastic approximation, and the DIRECT methods using six test problems from the literature. An application case study on an inventory system is also documented. The results suggest that the proposed method has excellent consistency and efficiency in finding global optimal solutions, and is particularly useful for expensive systems.