Antithetic Variates, Common Random Numbers and Optimal Computer Time Allocation in Simulation
暂无分享,去创建一个
Two simple variance reduction techniques are discussed, viz. antithetic variates and common random numbers. Their joint application creates undesirable negative correlations between the responses of two simulated systems. Therefore three alternatives are considered: antithetics only, common random numbers only, antithetic and common random numbers combined. No alternative is always best as is shown by analytical results for extremely simple systems and simulation results for simple queuing systems. Therefore a procedure is derived that starts with some pilot runs for both systems and estimates which alternative minimizes the variance; at the same time this procedure allocates the limited amount of computer time to the two systems in an optimal way. Results of the application of the procedure to several queuing systems are presented. Because of certain disadvantages of the procedure we may decide to select alternative 1 antithetics only a priori. Then the procedure can still be used for the optimal computer time allocation.
[1] James R. Emshoff,et al. Design and use of computer simulation models , 1970 .
[2] Thomas H. Wonnacott,et al. Methods for analyzing data from computer simulation experiments , 1967, CACM.
[3] H. Robbins,et al. Two-stage procedures for estimating the difference between means , 1954 .
[4] George S. Fishman. The Allocation of Computer Time in Comparing Simulation Experiments , 1968, Oper. Res..
[5] J. Halton. A Retrospective and Prospective Survey of the Monte Carlo Method , 1970 .