Article ID Journal Published Year Pages File Type
475888 Computers & Operations Research 2009 8 Pages PDF
Abstract

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.

Scope and PurposeWe investigate the problem of selecting the best systems when there are multiple objectives and discuss an approach to select a Pareto set, i.e., a set of non-dominated systems, from competing alternatives. We incorporate the indifference-zone approach into the Pareto set selection scheme.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,