Results 1  10
of
87
A Methodology for Fitting and Validating Metamodels in Simulation
 European Journal of Operational Research
, 1997
"... This expository paper discusses the relationships among metamodels, simulation models, and problem entities. A metamodel or response surface is an approximation of the input/output function implied by the underlying simulation model. There are several types of metamodel: linear regression, splines, ..."
Abstract

Cited by 94 (5 self)
 Add to MetaCart
This expository paper discusses the relationships among metamodels, simulation models, and problem entities. A metamodel or response surface is an approximation of the input/output function implied by the underlying simulation model. There are several types of metamodel: linear regression, splines, neural networks, etc. This paper distinguishes between fitting and validating a metamodel. Metamodels may have different goals: (i) understanding, (ii) prediction, (iii) optimization, and (iv) verification and validation. For this metamodeling, a process with thirteen steps is proposed. Classic design of experiments (DOE) is summarized, including standard measures of fit such as the Rsquare coefficient and crossvalidation measures. This DOE is extended to sequential or stagewise DOE. Several validation criteria, measures, and estimators are discussed. Metamodels in general are covered, along with a procedure for developing linear regression (including polynomial) metamodels. Keywords Simul...
Simple Procedures for Selecting the Best Simulated System when the Number of Alternatives Is Large
 Operations Research
, 1999
"... In this paper we address the problem of finding the simulated system with the best (maximum or minimum) expected performance when the number of alternatives is finite, but large enough that rankingandselection (R&S) procedures may require too much computation to be practical. Our approach i ..."
Abstract

Cited by 63 (14 self)
 Add to MetaCart
In this paper we address the problem of finding the simulated system with the best (maximum or minimum) expected performance when the number of alternatives is finite, but large enough that rankingandselection (R&S) procedures may require too much computation to be practical. Our approach is to use the data provided by the first stage of sampling in an R&S procedure to screen out alternatives that are not competitive and thereby avoid the (typically much larger) secondstage sample for these systems. Our procedures represent a compromise between standard R&S proceduresthat are easy to implement, but can be computationally inefficientand fully sequential proceduresthat can be statistically efficient, but are more difficult to implement and depend on more restrictive assumptions. We present a general theory for constructing combined screening and indifferencezone selection procedures, several specific procedures and a portion of an extensive empirical evaluation. ...
Pricing American options: A comparison of Monte Carlo simulation approaches
 Journal of Computational Finance
, 1999
"... A number of Monte Carlo simulationbased approaches have been proposed within the past decade to address the problem of pricing Americanstyle derivatives. The purpose of this paper is to empirically test some of these algorithms on a common set of problems in order to be able to assess the strength ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
A number of Monte Carlo simulationbased approaches have been proposed within the past decade to address the problem of pricing Americanstyle derivatives. The purpose of this paper is to empirically test some of these algorithms on a common set of problems in order to be able to assess the strengths and weaknesses of each approach as a function of the problem characteristics. In addition, we introduce another simulationbased approach that parameterizes the early exercise curve and casts the valuation problem as an optimization problem of maximizing the expected payoff (under the martingale measure) with respect to the associated parameters, the optimization problem carried out using a simultaneous perturbation stochastic approximation (SPSA) algorithm.
Stochastic Gradient Estimation
, 2006
"... We consider the problem of efficiently estimating gradients from stochastic simulation. Although the primary motivation is their use in simulation optimization, the resulting estimators can also be useful in other ways, e.g., sensitivity analysis. The main approaches described are finite differences ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
We consider the problem of efficiently estimating gradients from stochastic simulation. Although the primary motivation is their use in simulation optimization, the resulting estimators can also be useful in other ways, e.g., sensitivity analysis. The main approaches described are finite differences (including simultaneous perturbations), perturbation analysis, the likelihood ratio/score function method, and the use of weak derivatives.
Simulation Optimization
 In Proceedings of the 2001 Winter Simulation Conference, edited by
"... planning on register automata ..."
On choosing parameters in retrospectiveapproximation algorithms for simulationoptimization
 Proceedings of the 2006 Winter Simulation Conference. Institute of Electrical and Electronics Engineers: Piscataway
"... The Stochastic RootFinding Problem is that of finding a zero of a vectorvalued function known only through a stochastic simulation. The SimulationOptimization Problem is that of locating a realvalued function’s minimum, again with only a stochastic simulation that generates function estimates. ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
(Show Context)
The Stochastic RootFinding Problem is that of finding a zero of a vectorvalued function known only through a stochastic simulation. The SimulationOptimization Problem is that of locating a realvalued function’s minimum, again with only a stochastic simulation that generates function estimates. Retrospective Approximation (RA) is a samplepath technique for solving such problems, where the solution to the underlying problem is approached via solutions to a sequence of approximate deterministic problems, each of which is generated using a specified sample size, and solved to a specified error tolerance. Our primary focus, in this paper, is providing guidance on choosing the sequence of sample sizes and error tolerances in RA algorithms. We first present an overview of the conditions that guarantee the correct convergence of RA’s iterates. Then we characterize a class of errortolerance and samplesize sequences that are superior to others in a certain precisely defined sense. We also identify and recommend members of this class, and provide a numerical example illustrating the key results. 1
Optimal Structured Feedback Policies for ABR Flow Control Using Two Timescale SPSA
 Control,” Proceedings of the Summer Computer Simulation Conference, Society for Computer Simulation
, 1994
"... Abstract—Optimal structured feedback control policies for ratebased flow control of available bit rate service in asynchronous transfer mode networks are obtained in the presence of information and propagation delays, using a numerically efficient twotimescale simultaneous perturbation stochastic ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
(Show Context)
Abstract—Optimal structured feedback control policies for ratebased flow control of available bit rate service in asynchronous transfer mode networks are obtained in the presence of information and propagation delays, using a numerically efficient twotimescale simultaneous perturbation stochastic approximation algorithm. Models comprising both a single bottleneck node and a network with multiple bottleneck nodes are considered. A convergence analysis of the algorithm is presented. Numerical experiments demonstrate fast convergence even in the presence of significant delays. We also illustrate performance comparisons with the wellknown Explicit Rate Indication for Congestion Avoidance (ERICA) algorithm and describe another algorithm (based on ERICA) that does not require estimating available bandwidth (as in ERICA). Index Terms—Network of nodes, optimal structured feedback policies, ratebased ABR flow control, single bottleneck node, twotimescale SPSA. I.
Variablenumber samplepath optimization
"... The samplepath method is one of the most important tools in simulationbased optimization. The basic idea of the method is to approximate the expected simulation output by the average of sample observations with a common random number sequence. In this paper, we describe a new variant of Powell’s ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
The samplepath method is one of the most important tools in simulationbased optimization. The basic idea of the method is to approximate the expected simulation output by the average of sample observations with a common random number sequence. In this paper, we describe a new variant of Powell’s UOBYQA (Unconstrained Optimization BY Quadratic Approximation) method, which integrates a Bayesian VariableNumber SamplePath (VNSP) scheme to choose appropriate number of samples at each iteration. The statistically accurate scheme determines the number of simulation runs, and guarantees the global convergence of the algorithm. The VNSP scheme saves a significant amount of simulation operations compared to general purpose ‘fixednumber' samplepath methods. We present numerical results based on the new algorithm.
Estimationbased local search for stochastic combinatorial optimization
 IRIDIA, Université Libre de Bruxelles
, 2007
"... informs doi 10.1287/ijoc.1080.0276 ..."
(Show Context)
The Value of Information Sharing in a TwoStage Supply Chain with Production Capacity Constraints
 Naval Research Logistics
, 2003
"... We study the value of information sharing in a twostage supply chain with a single manufacturer and a single retailer in infinite time horizon, where the manufacturer has finite production capacity and the retailer faces independent demand. The manufacturer receives demand information even during ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
We study the value of information sharing in a twostage supply chain with a single manufacturer and a single retailer in infinite time horizon, where the manufacturer has finite production capacity and the retailer faces independent demand. The manufacturer receives demand information even during periods of time in which the retailer does not order. Allowing for time varying cost functions, our objective is to characterize the impact of information sharing on the manufacturer’s cost and service level. We develop a new approach to characterize the induced Markov chain under cyclic orderupto policy. Taking advantage of the model’s special cost structure, we show that a cyclic orderupto policy is optimal for the manufacturer under the average cost criterion. Using extensive computational analysis, we quantify the impact of information sharing on the manufacturer’s performance in infinite time horizon under both i.i.d demand and independent but nonstationary demand.