Selecting the best system: a decision-theoretic approach
Proceedings of the 29th conference on Winter simulation
New development of optimal computing budget allocation for discrete event simulation
Proceedings of the 29th conference on Winter simulation
An approach to ranking and selection for multiple performance measures
Proceedings of the 30th conference on Winter simulation
Simulation Budget Allocation for Further Enhancing theEfficiency of Ordinal Optimization
Discrete Event Dynamic Systems
New Two-Stage and Sequential Procedures for Selecting the Best Simulated System
Operations Research
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A Multiple Attribute Utility Theory Approach to Ranking and Selection
Management Science
Selecting the best stochastic system for large scale problems in DEDS
Mathematics and Computers in Simulation
Optimal computing budget allocation for multi-objective simulation models
WSC '04 Proceedings of the 36th conference on Winter simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
Multi-objective ordinal optimization for simulation optimization problems
Automatica (Journal of IFAC)
High performance computing for dynamic multi-objective optimisation
International Journal of High Performance Systems Architecture
Guessing preferences: a new approach to multi-attribute ranking and selection
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
In this paper, we present how a solution framework developed for (a special case of) the multi-objective simulation-optimization problems can be applied to evaluate and optimally select the non-dominated set of inventory policies for two case study problems. Based on the concept of Pareto optimality, the solution framework mainly includes how to evaluate the quality of the selected Pareto set by two types of errors, and how to allocate the simulation replications according to some asymptotic allocation rules. Given a fixed set of inventory policies for both case study problems, the proposed solution method is applied to allocate the simulation replications. Results show that the solution framework is efficient and robust in terms of the total number of simulation replications needed to find the non-dominated Pareto set of inventory policies.