Simulation optimization: A review of algorithms and applications
pith:ZCKJ2F7G Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{ZCKJ2F7G}
Prints a linked pith:ZCKJ2F7G badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
Simulation Optimization (SO) refers to the optimization of an objective function subject to constraints, both of which can be evaluated through a stochastic simulation. To address specific features of a particular simulation---discrete or continuous decisions, expensive or cheap simulations, single or multiple outputs, homogeneous or heterogeneous noise---various algorithms have been proposed in the literature. As one can imagine, there exist several competing algorithms for each of these classes of problems. This document emphasizes the difficulties in simulation optimization as compared to mathematical programming, makes reference to state-of-the-art algorithms in the field, examines and contrasts the different approaches used, reviews some of the diverse applications that have been tackled by these methods, and speculates on future directions in the field.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Taking the GP Out of the Loop
ENN surrogate replaces GPs in TuRBO, delivering O(N) scaling for fitting and acquisition and 10-100x faster proposals on large observation counts.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.