Discrete Optimization via Simulation Using Gaussian Markov Random Fields
The problem is maximizing or minimizing the expected value of a stochastic performance measure that can be observed by running a dynamic, discrete-event simulation when the feasible solutions are defined by integer decision variables. Inventory sizing, call center staffing and manufacturing system design are common applications. Standard approaches are ranking and selection, which takes no advantage of the relationship among solutions, and adaptive random search, which exploits it but in a heuristic way (“good solutions tend to be clustered”). Instead, we construct an optimization procedure built on modeling the relationship as a discrete Gaussian Markov random field (GMRF). This enables computation of the expected improvement (EI) that could be obtained by running the simulation for any feasible solution, whether actually simulated or not. The computation of EI can be numerically challenging, in general, but the GMRF representation greatly reduces the burden. No background in simulation optimization or GMRFs is assumed, and intuition is emphasized over theory.
Missouri University of Science and Technology
Source Publication Title
Spring 2016 - Bernard Sarchet Graduate Seminar Series
Nelson, Barry, "Discrete Optimization via Simulation Using Gaussian Markov Random Fields" (2016). Engineering Management and Systems Engineering Videos. 69.
© 2016 Missouri University of Science and Technology, All rights reserved.
Video - Course materials