49,460 research outputs found
A comprehensive literature classification of simulation optimisation methods
Simulation Optimization (SO) provides a structured approach to the system design and configuration when analytical expressions for input/output relationships are unavailable. Several excellent surveys have been written on this topic. Each survey concentrates on only few classification criteria. This paper presents a literature survey with all classification criteria on techniques for SO according to the problem of characteristics such as shape of the response surface (global as compared to local optimization), objective functions (single or multiple objectives) and parameter spaces (discrete or continuous parameters). The survey focuses specifically on the SO problem that involves single per-formance measureSimulation Optimization, classification methods, literature survey
Approximate IPA: Trading Unbiasedness for Simplicity
When Perturbation Analysis (PA) yields unbiased sensitivity estimators for
expected-value performance functions in discrete event dynamic systems, it can
be used for performance optimization of those functions. However, when PA is
known to be unbiased, the complexity of its estimators often does not scale
with the system's size. The purpose of this paper is to suggest an alternative
approach to optimization which balances precision with computing efforts by
trading off complicated, unbiased PA estimators for simple, biased approximate
estimators. Furthermore, we provide guidelines for developing such estimators,
that are largely based on the Stochastic Flow Modeling framework. We suggest
that if the relative error (or bias) is not too large, then optimization
algorithms such as stochastic approximation converge to a (local) minimum just
like in the case where no approximation is used. We apply this approach to an
example of balancing loss with buffer-cost in a finite-buffer queue, and prove
a crucial upper bound on the relative error. This paper presents the initial
study of the proposed approach, and we believe that if the idea gains traction
then it may lead to a significant expansion of the scope of PA in optimization
of discrete event systems.Comment: 8 pages, 8 figure
The role of learning on industrial simulation design and analysis
The capability of modeling real-world system operations has turned simulation into an indispensable problemsolving methodology for business system design and analysis. Today, simulation supports decisions ranging
from sourcing to operations to finance, starting at the strategic level and proceeding towards tactical and
operational levels of decision-making. In such a dynamic setting, the practice of simulation goes beyond
being a static problem-solving exercise and requires integration with learning. This article discusses the role
of learning in simulation design and analysis motivated by the needs of industrial problems and describes
how selected tools of statistical learning can be utilized for this purpose
Hybrid Pathwise Sensitivity Methods for Discrete Stochastic Models of Chemical Reaction Systems
Stochastic models are often used to help understand the behavior of
intracellular biochemical processes. The most common such models are continuous
time Markov chains (CTMCs). Parametric sensitivities, which are derivatives of
expectations of model output quantities with respect to model parameters, are
useful in this setting for a variety of applications. In this paper, we
introduce a class of hybrid pathwise differentiation methods for the numerical
estimation of parametric sensitivities. The new hybrid methods combine elements
from the three main classes of procedures for sensitivity estimation, and have
a number of desirable qualities. First, the new methods are unbiased for a
broad class of problems. Second, the methods are applicable to nearly any
physically relevant biochemical CTMC model. Third, and as we demonstrate on
several numerical examples, the new methods are quite efficient, particularly
if one wishes to estimate the full gradient of parametric sensitivities. The
methods are rather intuitive and utilize the multilevel Monte Carlo philosophy
of splitting an expectation into separate parts and handling each in an
efficient manner.Comment: 30 pages. The numerical example section has been extensively
rewritte
A relative entropy rate method for path space sensitivity analysis of stationary complex stochastic dynamics
We propose a new sensitivity analysis methodology for complex stochastic
dynamics based on the Relative Entropy Rate. The method becomes computationally
feasible at the stationary regime of the process and involves the calculation
of suitable observables in path space for the Relative Entropy Rate and the
corresponding Fisher Information Matrix. The stationary regime is crucial for
stochastic dynamics and here allows us to address the sensitivity analysis of
complex systems, including examples of processes with complex landscapes that
exhibit metastability, non-reversible systems from a statistical mechanics
perspective, and high-dimensional, spatially distributed models. All these
systems exhibit, typically non-gaussian stationary probability distributions,
while in the case of high-dimensionality, histograms are impossible to
construct directly. Our proposed methods bypass these challenges relying on the
direct Monte Carlo simulation of rigorously derived observables for the
Relative Entropy Rate and Fisher Information in path space rather than on the
stationary probability distribution itself. We demonstrate the capabilities of
the proposed methodology by focusing here on two classes of problems: (a)
Langevin particle systems with either reversible (gradient) or non-reversible
(non-gradient) forcing, highlighting the ability of the method to carry out
sensitivity analysis in non-equilibrium systems; and, (b) spatially extended
Kinetic Monte Carlo models, showing that the method can handle high-dimensional
problems
Optimization and sensitivity analysis of computer simulation models by the score function method
Experimental Design;Simulation;Optimization;Queueing Theory
Sensitivity Analysis of Simulation Models
This contribution presents an overview of sensitivity analysis of simulation models, including the estimation of gradients. It covers classic designs and their corresponding (meta)models; namely, resolution-III designs including fractional-factorial two-level designs for first-order polynomial metamodels, resolution-IV and resolution-V designs for metamodels augmented with two-factor interactions, and designs for second-degree polynomial metamodels including central composite designs. It also reviews factor screening for simulation models with very many factors, focusing on the so-called "sequential bifurcation" method. Furthermore, it reviews Kriging metamodels and their designs. It mentions that sensitivity analysis may also aim at the optimization of the simulated system, allowing multiple random simulation outputs.simulation;sensitivity analysis;gradients;screening;Kriging;optimization;Response SurfaceMethodology;Taguchi
- ā¦