A fully sequential procedure for indifference-zone selection in simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Comparing systems via stochastic simulation: an enhanced two-stage selection procedure
Proceedings of the 32nd conference on Winter simulation
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Simulation Budget Allocation for Further Enhancing theEfficiency of Ordinal Optimization
Discrete Event Dynamic Systems
Multivariate ranking and selection without reduction to a univariate problem
WSC '78 Proceedings of the 10th conference on Winter simulation - Volume 1
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A Multiple Attribute Utility Theory Approach to Ranking and Selection
Management Science
Using Ordinal Optimization Approach to Improve Efficiency of Selection Procedures
Discrete Event Dynamic Systems
Comparison with a Standard via All-Pairwise Comparisons
Discrete Event Dynamic Systems
Optimal computing budget allocation for multi-objective simulation models
WSC '04 Proceedings of the 36th conference on Winter simulation
Proceedings of the 38th conference on Winter simulation
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
Indifference-zone subset selection procedures: using sample means to improve efficiency
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Guessing preferences: a new approach to multi-attribute ranking and selection
Proceedings of the Winter Simulation Conference
Hi-index | 0.01 |
Ranking and selection (R&S) procedures have been widely studied and applied in determining the required sample size (i.e., the number of replications or batches) for selecting the best system or a subset containing the best system from a set of k alternatives. Most of the studies in the R&S have focused on a single measure of system performance. In many practical situations, however, we need to select systems based on multiple criteria. A solution is called Pareto optimal if there exists no other solution which is better in all criteria. This paper discusses extending a R&S procedure to select a Pareto set containing non-dominated systems. Computational results show that the proposed procedures are effective in obtaining non-dominated systems.