Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 49, No. 6, November-December 2001, pp. 950-963
DOI: 10.1287/opre.49.6.950.10019
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Nelson, B. L.
Right arrow Articles by Song, W.
Right arrow Search for Related Content

Simple Procedures for Selecting the Best Simulated System When the Number of Alternatives is Large

Barry L. Nelson, Julie Swann, David Goldsman, Wheyming Song

Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208-3119
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Department of Industrial Engineering, National Tsing Hua University, Hsinchu R.O.C., Taiwan

nelsonb{at}northwestern.edu
julie.swann{at}isye.gatech.edu
sman{at}isye.gatech.edu
wheyming{at}ie.nthu.edu.tw

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 ranking-and-selection (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) second-stage sample for these systems. Our procedures represent a compromise between standard R&S procedures—which are easy to implement, but can be computationally inefficient—and fully sequential procedures—which 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 indifference-zone selection procedures, several specific procedures and a portion of an extensive empirical evaluation.

Subject classifications: Simulation, design of experiments: two-stage procedures; Simulation, statistical analysis: finding the best alternative; Statistics, design of experiments.
History: Received January 1998; revision received January 1999; revision received November 1999; accepted July 2000.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by INFORMS.