Efficient Simulation Budget Allocation for Selecting an Optimal Subset

Published Online:https://doi.org/10.1287/ijoc.1080.0268

References

  • Andradóttir S., Goldsman D., Schmeiser B. W., Schruben L. W., Yücesan E. Analysis methodology: Are we done? Proc. 2005 Winter Simulation Conf. (2005) (Association for Computing Machinery, New York) 790–796CrossrefGoogle Scholar
  • Baluja S. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. (1994) . Technical Report CMU-CS-94-163, School of Computer Science, Carnegie Mellon University, PittsburghGoogle Scholar
  • Bechhofer R. E., Santner T. J., Goldsman D. M.Design and Analysis of Experiments for Statistical Selection, Screening, and Multiple Comparisons (1995) (John Wiley & Sons, New York) Google Scholar
  • Branke J., Chick S. E., Schmidt C. Selecting a selection procedure. Management Sci. (2007) 53:1916–1932LinkGoogle Scholar
  • Chambers L.Practical Handbook of Genetic Algorithms (1995) (CRC Press, Boca Raton, FL) CrossrefGoogle Scholar
  • Chen C. H. A lower bound for the correct subset-selection probability and its application to discrete event system simulations. IEEE Trans. Automatic Control (1996) 41:1227–1231CrossrefGoogle Scholar
  • Chen C. H., He D., Fu M. Efficient dynamic simulation allocation in ordinal optimization. IEEE Trans. Automatic Control (2006) 51:2005–2009CrossrefGoogle Scholar
  • Chen C. H., Lin J., Yücesan E., Chick S. E. Simulation budget allocation for further enhancing the efficiency of ordinal optimization. J. Discrete Event Dynam. Systems: Theory Appl. (2000) 10:251–270CrossrefGoogle Scholar
  • Chen H. C., Chen C. H., Dai L., Yücesan E. New development of optimal computing budget allocation for discrete event simulation. Proc. 1997 Winter Simulation Conf. (1997) (Association for Computing Machinery, New York) 334–341CrossrefGoogle Scholar
  • Chick S., Inoue K. New two-stage and sequential procedures for selecting the best simulated system. Oper. Res. (2001a) 49:1609–1624LinkGoogle Scholar
  • Chick S., Inoue K. New procedures to select the best simulated system using common random numbers. Management Sci. (2001b) 47:1133–1149LinkGoogle Scholar
  • DeGroot M. H.Optimal Statistical Decisions (1970) (McGraw-Hill, New York) Google Scholar
  • Dudewicz E. J., Dalal S. R. Allocation of observations in ranking and selection with unequal variances. Sankhya (1975) 37:28–78Google Scholar
  • Fu M. C., Hu J., Marcus S. I. Model-based randomized methods for global optimization. Proc. 17th Internat. Sympos. Math. Theory Networks Systems, Kyoto, Japan (2006) 355–363Google Scholar
  • Fu M. C., Hu J. Q., Chen C. H., Xiong X. Simulation allocation for determining the best design in the presence of correlated sampling. INFORMS J. Comput. (2007) 19:101–111LinkGoogle Scholar
  • Goldsman D., Nelson B. L., Banks J. Comparing systems via simulation. Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice (1998) (John Wiley & Sons, New York) 273–306CrossrefGoogle Scholar
  • Gupta S. S. On some multiple decision (selection and ranking) rules. Technometrics (1965) 7:225–245CrossrefGoogle Scholar
  • He D., Chick S. E., Chen C. H. Opportunity cost and OCBA selection procedures in ordinal optimization for a fixed number of alternative systems. IEEE Trans. Systems, Man, Cybernetics—Part C (2007) 37:951–961CrossrefGoogle Scholar
  • Holland J. H.Adaptation in Natural and Artificial Systems (1975) (The University of Michigan Press, Ann Arbor) Google Scholar
  • Hu J., Fu M. C., Marcus S. I. A model reference adaptive search algorithm for global optimization. Oper. Res. (2007a) 55:549–568LinkGoogle Scholar
  • Hu J., Fu M. C., Marcus S. I. A model reference adaptive search algorithm for stochastic optimization with applications to Markov decision processes. Proc. 46th IEEE Conf. Decision Control (2007b) (IEEE Press, Washington, D.C.) 975–980Google Scholar
  • Inoue K., Chick S. E. Comparison of Bayesian and frequentist assessments of uncertainty for selecting the best system. Proc. 1998 Winter Simulation Conf. (1998) (Institute of Electrical and Electronic Engineers, Piscataway, NJ) 727–734CrossrefGoogle Scholar
  • Inoue K., Chick S. E., Chen C. H. An empirical evaluation of several methods to select the best system. ACM Transitions Model. Comput. Simulation (1999) 9:381–407CrossrefGoogle Scholar
  • Kim S.-H., Nelson B. L., Henderson S. G., Nelson B. L. Selecting the best system. Handbooks in Operations Research and Management Science: Simulation (2006) (Elsevier, New York) . Chapter 18Google Scholar
  • Koenig L. W., Law A. M. A procedure for selecting a subset of size m containing the l best of k independent normal populations. Comm. Statist.—Simulation Comm. (1985) 14:719–734CrossrefGoogle Scholar
  • Law A. M., Kelton W. D.Simulation Modeling Analysis (2000) (McGraw-Hill, New York) Google Scholar
  • Lee L. H., Chew E. P., Teng S. Y., Goldsman D. Optimal computing budget allocation for multi-objective simulation models. Proc. 2004 Winter Simulation Conf. (2004) (Association for Computing Machinery, New York) 586–594CrossrefGoogle Scholar
  • Rinott Y. On two-stage selection procedures and related probability inequalities. Comm. Statist. (1978) 7:799–811CrossrefGoogle Scholar
  • Rubinstein R. Y., Kroese D. P.The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning (2004) (Springer, New York) CrossrefGoogle Scholar
  • Rudlof S., Köppen M. Stochastic hill climbing with learning by vectors of normal distributions. Proc. First Online Workshop on Soft Comput. (1996) (Nagoya University, Nagoya, Japan) 60–70Google Scholar
  • Sullivan D. W., Wilson J. R. Restricted subset selection procedures for simulation. Oper. Res. (1989) 37:52–71LinkGoogle Scholar
  • Swisher J. R., Jacobson S. H., Yücesan E. Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey. ACM Trans. Model. Comput. Simulation (2003) 13:134–154CrossrefGoogle Scholar
  • Trailovic L., Pao L. Y. Computing budget allocation for efficient ranking and selection of variances with application to target tracking algorithms. IEEE Trans. Automatic Control (2004) 49:58–67CrossrefGoogle Scholar
  • Walker R. C.Introduction to Mathematical Programming (1999) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.