Opportunity Cost and OCBA Selection Procedures in Ordinal Optimization for a Fixed Number of Alternative Systems
- 20 August 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Vol. 37 (5), 951-961
- https://doi.org/10.1109/tsmcc.2007.900656
Abstract
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.Keywords
This publication has 18 references indexed in Scilit:
- Selection Procedures with Frequentist Expected Opportunity Cost BoundsOperations Research, 2005
- Computing Budget Allocation for Efficient Ranking and Selection of Variances With Applicationto Target Tracking AlgorithmsIEEE Transactions on Automatic Control, 2004
- Scheduling semiconductor wafer fabrication by using ordinal optimization-based simulationIEEE Transactions on Robotics and Automation, 2001
- New Procedures to Select the Best Simulated System Using Common Random NumbersManagement Science, 2001
- Ordinal optimisation and simulationJournal of the Operational Research Society, 2000
- An empirical evaluation of several methods to select the best systemACM Transactions on Modeling and Computer Simulation, 1999
- Intelligent resource simulation for an airport check-in counter allocation systemIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1999
- Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisons in SimulationManagement Science, 1995
- A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulationCommunications in Statistics - Simulation and Computation, 1985
- On two-stage selection procedures and related probability-inequalitiesCommunications in Statistics - Theory and Methods, 1978