|
ABSTRACT
Our problem is that of finding the best system---i.e., the system with the largest or smallest primary performance measure---among a finite number of simulated systems in the presence of a stochastic constraint on a secondary performance measure. In order to solve this problem, we first find a set that contains only feasible or near-feasible systems (Phase I) and then choose the best among those systems in the set (Phase II). We present a statistically valid procedure for Phase I and then propose another procedure that performs Phases I and II sequentially to find the best feasible system. Finally, we provide some experimental results for the second procedure.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Andradóttir, S., D. Goldsman, and S.-H. Kim. 2005. Fully sequential procedures for comparing constrained systems via simulation. Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia.
|
| |
2
|
Bechhofer, R. E. 1954. A single-sample multiple decision procedure for ranking means of normal populations with known variances. Annals of Mathematical Statistics, 25:16--39.
|
| |
3
|
|
| |
4
|
|
| |
5
|
Chen, C.-H. 1996. A lower bound for the correct-selection probability and its application to discrete event simulations. IEEE Transactions on Automatic Control, 41:1227--1231.
|
| |
6
|
Hsiao-Chang Chen , Liyi Dai , Chun-Hung Chen , Enver Yücesan, New development of optimal computing budget allocation for discrete event simulation, Proceedings of the 29th conference on Winter simulation, p.334-341, December 07-10, 1997, Atlanta, Georgia, United States
[doi> 10.1145/268437.268501]
|
| |
7
|
Chen, H.-C., C.-H. Chen, and E. Yücesan. 2000. Computing efforts allocation for ordinal optimization and discrete event simulation. IEEE Transactions on Automatic Control, 45: 960--964.
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
Goldsman, D., and B. L. Nelson. 1998. Comparing systems via simulation. In Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice, ed. J. Banks, 273--306. New York: John Wiley & Sons.
|
| |
14
|
Hartmann, M. 1988. An improvement on Paulson's sequential ranking procedure. Sequential Analysis, 7:363--372.
|
| |
15
|
Hartmann, M. 1991. An improvement on Paulson's procedure for selecting the population with the largest mean from k normal populations with a common unknown variance. Sequential Analysis, 10:1--16.
|
| |
16
|
|
 |
17
|
|
 |
18
|
|
| |
19
|
Kim, S.-H., and B. L. Nelson. 2005. On the asymptotic validity of fully sequential selection procedures for steady-state simulation. Operations Research, forthcoming.
|
| |
20
|
|
| |
21
|
Paulson, E. 1964. A sequential procedure for selecting the population with the largest mean from k normal populations. Annals of Mathematical Statistics, 35:174--180.
|
| |
22
|
|
| |
23
|
Pichitlamken, J., B. L. Nelson, and L. J. Hong. 2005. A sequential procedure for neighborhood selection-of-the-best in optimization via simulation. European Journal of Operational Research, forthcoming.
|
| |
24
|
Rinott, Y. 1978. On two-stage selection procedures and related probability-inequalities. Communications in Statistics, A7:799--811.
|
| |
25
|
Santner, T. J., and A. C. Tamhane. 1984. Designing experiments for selecting a normal population with a large mean and a small variance. In Design of Experiments - Ranking and Selection: Essays in Honor of Robert E. Bechhofer, ed. T. J. Santner and A. C. Tamhane, 179--198. New York: Marcel-Dekker.
|
|