Abstract
This paper develops a generic procedure for selection with constraints. The bounds of current selection with constraints are based on user-specified values of the underlying performance measures. In some cases, users have no priori of what the values of the secondary performance measures may be, hence, the specified values may not be accurate. On the basis of the difference between comparison with a standard and comparison with a control, we propose using relative performance measures as constraints. That is, systems having each performance measure within a user-specified amount of the unknown best are considered as feasible systems. An experimental performance evaluation demonstrates the validity and efficiency of the selection-with-constraints procedure.
Similar content being viewed by others
References
Andradóttir S and Kim SH (2010). Fully sequential procedures for comparing constrained systems via simulation. Naval Research Logistics 57 (5): 403–421.
Batur D and Choobineh FF (2010). Mean-variance based randking and selection. In: Johansson B, Jain S, Montoya-Torres J, Hugan J and Yücesan E (eds). Proceedings of the 2010 Winter Simulation Conference. Institute of Electrical and Electronics Engineers: Piscataway, NJ, pp 1160–1166.
Butler J, Morrice DJ and Mullarkey PW (2001). A multiple attribute utility theory approach to ranking and selection. Management Science 47: 800–816.
Chen EJ (2008). Selecting designs with the smallest variance of normal populations. Journal of Simulation 2 (3): 186–194.
Chen EJ (2011). The range statistic and procedures to select the best systems. Journal of Simulation 5 (4): 292–300.
Chen EJ (2012). Order statistics in simulation. Encyclopedia of Business Analytics and Optimization. Submitted.
Chen EJ and Kelton WD (2007). A procedure for generating batch-means confidence interval for simulation: Checking independence and normality. Simulation: Transactions of The Society for Modeling and Simulation International 83 (10): 683–694.
Chen EJ and Lee LH (2009). A multi-objective selection procedure of determining a pareto set. Computers and Operations Research 36 (6): 1872–1879.
Chen EJ and Li M (2010). A new approach to estimate the critical constant of selection procedures. Advances in Decision Sciences 2010: 12 Article ID 948359.
Dudewicz EJ and Dalal SR (1975). Allocation of observations in ranking and selection with unequal variances. Sankhya B37 (1): 28–78.
Hogg RV and Craig AT (1995). Introduction to Mathematical Statics, 5th edn. Prentice Hall: New Jersey.
Law AM (2007). Simulation Modeling and Analysis, 4th edn. McGraw-Hill: New York.
Morrice DJ and Butler JC (2006). Ranking and selection with multiple ‘targets’. In: Perrone LF, Wieland FP, Liu J, Lawson BG, Nicol DM and Fujimoto RM (eds). Proceedings of the 2006 Winter Simulation Conference. Institute of Electrical and Electronics Engineers: Piscataway, NJ, pp 222–230.
Rinott Y (1978). On two-stage selection procedures and related probability inequalities. Communications in Statistics A7 (8): 799–811.
Tippett LHC (1925). On the extreme individuals and the range of samples taken from a normal population. Biometrika 17 (3/4): 264–387.
Acknowledgements
The author thanks the referees for their comments, which improved both the content and exposition of the paper.
Author information
Authors and Affiliations
Appendices
Appendix A
The two-stage procedure of Dudewicz and Dalal (1975) to select the best of k systems has been widely studied and applied. They perform the selection on the weighted sample means X̃ i =Wi1X̄ i (1)+Wi2X̄ i (2) for i=1,2,…, k. Here, the weights
and Wi2=1−Wi1, for i=1,2,…, k. The expression for Wi1 was chosen to guarantee (X̃ i −μ i )/(d*/h1) have a t distribution with n0−1 degrees of freedom. Note that h1 (which depends on k, n0, and P*) is a constant that can be found from the tables in Law (2007). The procedure proceeds as follows.
-
1)
Simulate the initial n0 samples for all systems. Compute the first-stage sample means
and sample variances
for i=1,2,…, k.
-
2)
Compute the required sample sizes
where ⌈z⌉ is the smallest integer that is greater than or equal to the real number z.
-
3)
Simulate additional N i −n0 samples.
-
4)
Compute the second-stage sample means
-
5)
Compute the weighted sample means
and select the system with the smallest X̃ i .
Appendix B
Let T i for i=1,2,…, k, be independent t-distributed random variables with n0−1 d.f. and let F denote the cdf of the t distribution with n0−1 d.f. Let , under the null hypothesis that , and we can write
Note that in this setting δ=d*/2 instead of d* needs to be used when computing the weight. We equate the right-hand side to P* and solve for h1.
Under the null hypothesis that , we can write
The last equality holds because is the sample range and the right-hand-side is the cdf of the sample range, see Tippett (1925). We equate the right-hand side to P* and solve for h3.
Rights and permissions
About this article
Cite this article
Chen, E. A generic selection-with-constraints procedure. J Simulation 7, 126–136 (2013). https://doi.org/10.1057/jos.2012.19
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jos.2012.19