2003
DOI: 10.1287/opre.51.5.814.16751
|View full text |Cite
|
Sign up to set email alerts
|

Using Ranking and Selection to “Clean Up” after Simulation Optimization

Abstract: In this paper we address the problem of finding the simulated system with the best (maximum or minimum) expected performance when the number of systems is large and initial samples from each system have already been taken. This problem may be encountered when a heuristic search procedure-perhaps one originally designed for use in a deterministic environment-has been applied in a simulationoptimization context. Because of stochastic variation, the system with the best sample mean at the end of the search proced… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
88
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 152 publications
(94 citation statements)
references
References 16 publications
0
88
0
Order By: Relevance
“…One could include, for instance, a R&S procedure that acts as a "clean-up" in the identification step (see, e.g., the procedure proposed in Boesel, Nelson, & Kim, 2003 ); the aim of this R&S procedure is to discard the bad alternatives in T and find a sufficiently good one using as few replications as possible. Alternatively, R&S could be used in the optional replication step (see Fig.…”
Section: Effect Of the Identification Stepmentioning
confidence: 99%
“…One could include, for instance, a R&S procedure that acts as a "clean-up" in the identification step (see, e.g., the procedure proposed in Boesel, Nelson, & Kim, 2003 ); the aim of this R&S procedure is to discard the bad alternatives in T and find a sufficiently good one using as few replications as possible. Alternatively, R&S could be used in the optional replication step (see Fig.…”
Section: Effect Of the Identification Stepmentioning
confidence: 99%
“…Nelson et al (2001) present a general theory and procedures for reducing sampling efforts in a two-stage indifference-zone approach when the number of alternatives is large. Boesel (2000) and Boesel et al (2003) study the problem of finding the best system when the number of systems is large and initial samples from each system have already been taken. These articles develop statistical procedures that identify the best system encountered in the search by using a variety of approaches including subset selection and indifference-zone.…”
Section: Discrete Decision Spacementioning
confidence: 99%
“…If there exist systems whose means are within δ of the best, then the experimenter is indifferent to which of these is selected. Recent references include Nelson et al (2001), Boesel et al (2003), and Nelson (2001, 2005).…”
Section: Introductionmentioning
confidence: 99%