Simulation optimization: A review of algorithms and applications

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.

References in corpus (1)

• Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design

Cited by in corpus (10)

• Derivative-free optimization methods
• Surrogate-based toll optimization in a large-scale heterogeneously congested network
• Pitfalls and Protocols in Practice of Manufacturing Data Science
• SMGO: A Set Membership Approach to Data-Driven Global Optimization
• Calibrating Path Choices and Train Capacities for Urban Rail Transit Simulation Models Using Smart Card and Train Movement Data
• Automated Determination of Hybrid Particle-Field Parameters by Machine Learning
• Augmented Probability Simulation Methods for Sequential Games
• Fortran code for generating random probability vectors, unitaries, and quantum states
• Going faster to see further: GPU-accelerated value iteration and simulation for perishable inventory control using JAX
• Inverse design of drying-induced assembly of multicomponent colloidal-particle films using surrogate models