摘要：Ordinal optimization concentrates on isolating a subset of good designs with high probability and reduces the required simulation time dramatically for discrete event simulation. To obtain the same probability level,we may optimally allocate our computing budget among different designs,instead of equally simulating all different designs. In this paper we present an effective approach to optimally allocate computing budget for discrete-event system simulation. While ordinal optimization can dramatically reduce the computation cost, our approach can further reduce the already-low cost.

注：因版权方要求，不能公开全文，如需全文，请咨询杂志社