This is the authors' abstract. We don't add key points for this paper.
Many decision problems in modern industries involve the performance optimization of discrete-event dynamic systems. Because of the stochasticity of these systems, performance usually is evaluated through simulation. Finding the optimal designs of these systems can be modeled as a ranking and selection problem. This research considers the problem of selecting the best design from among numerous designs. We minimized the expected opportunity cost (EOC) of incorrect selection with a limited computing budget. The entire domain of designs could be divided into several adjacent partitions, and the performances of designs in each partition were estimated using a regression metamodel. We assumed the underlying function in each partition to be quadratic. Using large deviations theory, we then derived an asymptotically optimal budget allocation rule and developed a sequential allocation algorithm to implement the allocation rule. The EOC measure was compared with the probability of correct selection measure in a set of large-scale simulation optimization problems. Numerical experiments verified the effectiveness of our proposed simulation procedure.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Cao et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: