Answers are grounded in this paper and cite their sources.
Ordinal optimization offers an efficient approach for simulation optimization by focusing on ranking and selecting a finite set of good alternatives. Because simulation replications only give estimates of the performance of each alternative, there is a potential for incorrect selection. Two measures of selection quality are the alignment probability or the probability of correct selection (P{CS}), and the expected opportunity cost E[OC], of a potentially incorrect selection. Traditional ordinal optimization approaches focus on the former case. This paper extends Chen's optimal computing budget allocation (OCBA) approach, which allocated replications to improve P{CS}, to provide the first OCBA-like procedure that optimizes E[OC] in some sense. The procedure performs efficiently in numerical experiments.
No takes yet. Share an insight, caveat, or question.
He et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: