Abstract
We consider the problem of selecting the best feasible system with constraints on multiple secondary performance measures. We develop fully sequential indifference-zone procedures to solve this problem that guarantee a nominal probability of correct selection. In addition, we address two issues critical to the efficiency of these procedures: namely, the allocation of error between feasibility determination and selection of the best system, and the use of Common Random Numbers. We provide a recommended error allocation as a function of the number of constraints, supported by an experimental study and an approximate asymptotic analysis. The validity and efficiency of the new procedures with independent and CRN are demonstrated through both analytical and experimental results.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Selection Procedures for Simulations with Multiple Constraints under Independent and Correlated Sampling
- Sigrún Andradóttir and Seong-Hee Kim. 2010. Fully sequential procedures for comparing constrained systems via simulation. Naval Research Logistics 57, 5, 403--421.Google ScholarCross Ref
- Demet Batur and Seong-Hee Kim. 2010. Finding feasible systems in the presence of constraints on multiple performance measures. ACM Transactions on Modeling and Computer Simulation 20, 3, Article 13. Google ScholarDigital Library
- Chun-Hung Chen. 1996. A lower bound for the correct subset-selection probability and its application to discrete-event system simulations. IEEE Transactions on Automatic Control 41, 8, 1227--1231.Google ScholarCross Ref
- Hsiao-Chang Chen, Chun-Hung Chen, and Enver Yücesan. 2000. Computing efforts allocation for ordinal optimization and discrete event simulation. IEEE Transactions on Automatic Control 45, 5, 960--964.Google ScholarCross Ref
- Stephen E. Chick. 2006. Subjective probability and Bayesian methodology. In Shane G. Henderson and Barry L. Nelson (Eds.), Handbooks in Operations Research and Management Science (Vol. 13). Elsevier, 225--257.Google Scholar
- Stephen E. Chick and Koichiro Inoue. 2001. New procedures to select the best simulated system using common random numbers. Management Science 47, 8, 1133--1149. Google ScholarDigital Library
- Edward J. Dudewicz and Siddhartha R. Dalal. 1975. Allocation of observations in ranking and selection with unequal variances. Sankhya 37, 1, 28--78.Google Scholar
- Peter I. Frazier and Aleksandr M. Kazachkov. 2011. Guessing preferences: A new approach to multi-attribute ranking and selection. In Proceedings of the Winter Simulation Conference (WSC'11). 4324--4336. Google ScholarDigital Library
- Peter I. Frazier, Jing Xie, and Stephen E. Chick. 2011. Value of information methods for pairwise sampling with correlations. In Proceedings of the Winter Simulation Conference (WSC'11). 3979--3991. Google ScholarDigital Library
- Mark Hartmann. 1991. An improvement on Paulson's procedure for selecting the population with the largest mean from k normal populations with a common unknown variance. Sequential Analysis 10, 1--2 (1991), 1--16. Google ScholarDigital Library
- Christopher M. Healey, Sigrún Andradóttir, and Seong-Hee Kim. 2013. Efficient comparison of constrained systems using dormancy. European Journal of Operational Research 224, 2, 340--352.Google ScholarCross Ref
- Christopher M. Healey, Sigrún Andradóttir, and Seong-Hee Kim. 2014. A Minimal Switching Procedure for Constrained Ranking and Selection under Independent or Common Random Numbers. Technical Report.Google Scholar
- Susan R. Hunter, Chun-Hung Chen, Raghu Pasupathy, Nugroho Artadi Pujowidianto, Loo Hay Lee, and Chee Meng Yap. 2011. Optimal sampling laws for constrained simulation optimization on finite sets: The bivariate normal case. In Proceedings of the Winter Simulation Conference (WSC'11). 4294--4302. Google ScholarDigital Library
- Susan R. Hunter and Raghu Pasupathy. 2013. Optimal sampling laws for stochastically constrained simulation optimization on finite sets. INFORMS Journal on Computing 25, 3, 527--542. Google ScholarDigital Library
- Alireza Kabirian and Sigurdur Olafsson. 2009. Selection of the best with stochastic constraints. In Proceedings of the Winter Simulation Conference (WSC'09). 574--583. Google ScholarDigital Library
- Seong-Hee Kim and Barry L. Nelson. 2001. A fully sequential procedure for indifference-zone selection in simulation. ACM Transactions on Modeling and Computer Simulation 11, 3 (July 2001), 251--273. Google ScholarDigital Library
- Seong-Hee Kim and Barry L. Nelson. 2006. Selecting the best system. In Shane G. Henderson and Barry L. Nelson (Eds.), Handbooks in Operations Research and Management Science (Vol. 13). Elsevier, 501--534.Google Scholar
- Averill M. Law and David M. Kelton. 2000. Simulation Modeling and Analysis (3rd ed.). McGraw-Hill Higher Education. Google ScholarDigital Library
- Loo Hay Lee, Ek Peng Chew, Suyan Teng, and David Goldsman. 2010. Finding the non-dominated Pareto set for multi-objective simulation models. IIE Transactions 42, 9, 656--674.Google ScholarCross Ref
- Vadim Lesnevski, Barry L. Nelson, and Jeremy Staum. 2007. Simulation of coherent risk measures based on generalized scenarios. Management Science 53, 11, 1756--1769. Google ScholarDigital Library
- Douglas J. Morrice and John C. Butler. 2006. Ranking and selection with multiple “targets.” In Proceedings of the Winter Simulation Conference (WSC'06). 222--230. Google ScholarDigital Library
- Barry L. Nelson. 2010. Optimization via simulation over discrete decision variables. TutORials in Operations Research (Vol. 7). INFORMS, 965, 193--207.Google Scholar
- Barry L. Nelson and Frank J. Matejcik. 1995. Using common random numbers for indifference-zone selection and multiple comparisons in simulation. Management Science 41, 12, 1935--1945. Google ScholarDigital Library
- Edward Paulson. 1964. A sequential procedure for selecting the population with the largest mean from k normal populations. Annals of Mathematical Statistics 35, 1, 174--180.Google ScholarCross Ref
- S. K. Perng. 1969. A comparison of the asymptotic expected sample sizes of two sequential procedures for ranking problem. Annals of Mathematical Statistics 40, 6, 2198--2202.Google ScholarCross Ref
- Juta Pichitlamken, Barry L. Nelson, and L. Jeff Hong. 2006. A sequential procedure for neighborhood selection-of-the-best in optimization via simulation. European Journal of Operational Research 173, 1, 283--298.Google ScholarCross Ref
- Nugroho Artadi Pujowidianto, Loo Hay Lee, Chun-Hung Chen, and Chee Meng Yap. 2009. Optimal computing budget allocation for constrained optimization. In Proceedings of the Winter Simulation Conference (WSC'09). 584--589. Google ScholarDigital Library
- Yosef Rinott. 1978. On two-stage selection procedures and related probability-inequalities. Communications in Statistics: Theory and Methods 7, 8, 799--811.Google ScholarCross Ref
- Thomas J. Santner and Ajit C. Tamhane. 1984. Designing experiments for selecting a normal population with a large mean and a small variance. In Thomas J. Santner and Ajit C. Tamhane (Eds.), Design of Experiments—Ranking and Selection: Essays in Honor of Robert E. Bechhofer. Marcel-Dekker, 178--198.Google Scholar
- Roberto Szechtman and Enver Yücesan. 2008. A new perspective on feasibility determination. In Proceedings of the Winter Simulation Conference (WSC'08). 273--280. Google ScholarDigital Library
Index Terms
- Selection Procedures for Simulations with Multiple Constraints under Independent and Correlated Sampling
Recommendations
Finding feasible systems in the presence of constraints on multiple performance measures
We consider the problem of finding a set of feasible or near-feasible systems among a finite number of simulated systems in the presence of constraints on secondary performance measures. We first present a generic procedure that detects the feasibility ...
Chance Constrained Selection of the Best
Selecting the solution with the largest or smallest mean of a primary performance measure from a finite set of solutions while requiring secondary performance measures to satisfy certain constraints is called constrained selection of the best CSB in the ...
Some insights of using common random numbers in selection procedures
Indifference-zone selection procedures have been widely studied and applied to determine the sample sizes for selecting a good system or a subset of good systems among k alternative systems. It is known that using common random numbers can increase ...
Comments